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.

Kaydedildi:
Detaylı Bibliyografya
Asıl Yazarlar: Martin Bača, Muhammad Irfan, Joe Ryan, Andrea Semaničová-Feňovčíková, Dushyant Tanna
Materyal Türü: Artigo
Dil:Inglês
Baskı/Yayın Bilgisi: MDPI AG 2017-11-01
Seri Bilgileri:Mathematics
Konular:
edge irregular reflexive labelling
reflexive edge strength
cycles
generalized friendship graph
Online Erişim:https://www.mdpi.com/2227-7390/5/4/67
Etiketler: Etiketle
Etiket eklenmemiş, İlk siz ekleyin!

Benzer Materyaller