On edge irregular reflexive labellings for the generalized friendship graphs (Q1649059)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6898696
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On edge irregular reflexive labellings for the generalized friendship graphs |
scientific article; zbMATH DE number 6898696 |
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
0.8444864153862
0 references
0.8437720537185669
0 references
0.8107705116271973
0 references
0.8106393218040466
0 references
