On edge irregular reflexive labellings for the generalized friendship graphs
Mathematics, 2017•mdpi.com
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.
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.
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.
MDPI以上显示的是最相近的搜索结果。 查看全部搜索结果