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.

में बचाया:
ग्रंथसूची विवरण
मुख्य लेखकों: Martin Bača, Muhammad Irfan, Joe Ryan, Andrea Semaničová-Feňovčíková, Dushyant Tanna
स्वरूप: Artigo
भाषा:Inglês
प्रकाशित: MDPI AG 2017-11-01
श्रृंखला:Mathematics
विषय:
edge irregular reflexive labelling
reflexive edge strength
cycles
generalized friendship graph
ऑनलाइन पहुंच:https://www.mdpi.com/2227-7390/5/4/67
टैग : टैग जोड़ें
कोई टैग नहीं, इस रिकॉर्ड को टैग करने वाले पहले व्यक्ति बनें!

समान संसाधन