Open Research Newcastle
Browse

On edge irregular reflexive labellings for the generalized friendship graphs

Download (745.06 kB)
journal contribution
posted on 2025-05-09, 13:57 authored by Martin Bača, Muhammad Irfan, Joseph RyanJoseph Ryan, Andrea Semaničová-Feňovčíková, Dushyant Tanna
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.

History

Journal title

Mathematics

Volume

5

Issue

4

Article number

67

Publisher

MDPI AG

Language

  • en, English

College/Research Centre

Faculty of Engineering and Built Environment

School

School of Electrical Engineering and Computer Science

Rights statement

© 2017 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).

Usage metrics

    Publications

    Licence

    Exports

    RefWorks
    BibTeX
    Ref. manager
    Endnote
    DataCite
    NLM
    DC