Lanean...
On Edge Irregular Reflexive Labellings for the Generalized Friendship Graphs
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.
Gorde:
| Egile Nagusiak: | , , , , |
|---|---|
| Formatua: | Artigo |
| Hizkuntza: | Inglês |
| Argitaratua: |
MDPI AG
2017-11-01
|
| Saila: | Mathematics |
| Gaiak: | |
| Sarrera elektronikoa: | https://www.mdpi.com/2227-7390/5/4/67 |
| Etiketak: |
Etiketa erantsi
Etiketarik gabe, Izan zaitez lehena erregistro honi etiketa jartzen!
|