
doi: 10.3390/math5040067
handle: 1959.13/1353628
We study an edge irregular reflexive k-labelling for the generalized friendship graphs, also known as flowers (a symmetric collection of cycles meeting at a common vertex), and determine the exact value of the reflexive edge strength for several subfamilies of the generalized friendship graphs.
Graph labelling (graceful graphs, bandwidth, etc.), generalized friendship graph, edge irregular reflexive labelling; reflexive edge strength; cycles; generalized friendship graph, QA1-939, cycles, edge irregular reflexive labelling, reflexive edge strength, Mathematics
Graph labelling (graceful graphs, bandwidth, etc.), generalized friendship graph, edge irregular reflexive labelling; reflexive edge strength; cycles; generalized friendship graph, QA1-939, cycles, edge irregular reflexive labelling, reflexive edge strength, Mathematics
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 16 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Top 10% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
