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.
Main Authors: | , , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2017-11-01
|
Series: | Mathematics |
Subjects: | |
Online Access: | https://www.mdpi.com/2227-7390/5/4/67 |
_version_ | 1818133259490426880 |
---|---|
author | Martin Bača Muhammad Irfan Joe Ryan Andrea Semaničová-Feňovčíková Dushyant Tanna |
author_facet | Martin Bača Muhammad Irfan Joe Ryan Andrea Semaničová-Feňovčíková Dushyant Tanna |
author_sort | Martin Bača |
collection | DOAJ |
description | 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. |
first_indexed | 2024-12-11T08:49:53Z |
format | Article |
id | doaj.art-ee1dd33e7af244c5b884314dbaebda25 |
institution | Directory Open Access Journal |
issn | 2227-7390 |
language | English |
last_indexed | 2024-12-11T08:49:53Z |
publishDate | 2017-11-01 |
publisher | MDPI AG |
record_format | Article |
series | Mathematics |
spelling | doaj.art-ee1dd33e7af244c5b884314dbaebda252022-12-22T01:14:03ZengMDPI AGMathematics2227-73902017-11-01546710.3390/math5040067math5040067On Edge Irregular Reflexive Labellings for the Generalized Friendship GraphsMartin Bača0Muhammad Irfan1Joe Ryan2Andrea Semaničová-Feňovčíková3Dushyant Tanna4Department of Applied Mathematics and Informatics, Technical University, 042 00 Košice, SlovakiaAbdus Salam School of Mathematical Sciences, GC University, 54 000 Lahore, PakistanSchool of Electrical Engineering and Computer Science, the University of Newcastle, Callaghan, NSW 2308, AustraliaDepartment of Applied Mathematics and Informatics, Technical University, 042 00 Košice, SlovakiaSchool of Mathematical and Physical Sciences, the University of Newcastle, Callaghan, NSW 2308, AustraliaWe 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.https://www.mdpi.com/2227-7390/5/4/67edge irregular reflexive labellingreflexive edge strengthcyclesgeneralized friendship graph |
spellingShingle | Martin Bača Muhammad Irfan Joe Ryan Andrea Semaničová-Feňovčíková Dushyant Tanna On Edge Irregular Reflexive Labellings for the Generalized Friendship Graphs Mathematics edge irregular reflexive labelling reflexive edge strength cycles generalized friendship graph |
title | On Edge Irregular Reflexive Labellings for the Generalized Friendship Graphs |
title_full | On Edge Irregular Reflexive Labellings for the Generalized Friendship Graphs |
title_fullStr | On Edge Irregular Reflexive Labellings for the Generalized Friendship Graphs |
title_full_unstemmed | On Edge Irregular Reflexive Labellings for the Generalized Friendship Graphs |
title_short | On Edge Irregular Reflexive Labellings for the Generalized Friendship Graphs |
title_sort | on edge irregular reflexive labellings for the generalized friendship graphs |
topic | edge irregular reflexive labelling reflexive edge strength cycles generalized friendship graph |
url | https://www.mdpi.com/2227-7390/5/4/67 |
work_keys_str_mv | AT martinbaca onedgeirregularreflexivelabellingsforthegeneralizedfriendshipgraphs AT muhammadirfan onedgeirregularreflexivelabellingsforthegeneralizedfriendshipgraphs AT joeryan onedgeirregularreflexivelabellingsforthegeneralizedfriendshipgraphs AT andreasemanicovafenovcikova onedgeirregularreflexivelabellingsforthegeneralizedfriendshipgraphs AT dushyanttanna onedgeirregularreflexivelabellingsforthegeneralizedfriendshipgraphs |