On edge irregular reflexive labellings for the generalized friendship graphs (Q1649059): Difference between revisions
From MaRDI portal
Latest revision as of 01:36, 16 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On edge irregular reflexive labellings for the generalized friendship graphs |
scientific article |
Statements
On edge irregular reflexive labellings for the generalized friendship graphs (English)
0 references
5 July 2018
0 references
Summary: 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.
0 references
edge irregular reflexive labelling
0 references
reflexive edge strength
0 references
cycles
0 references
generalized friendship graph
0 references
