Abstract
A graph is a mod sum graph if there is a labeling of the vertices with distinct positive integers so that an edge is present if and only if the sum of the labels of the vertices incident on the edge, modulo some positive integers, is the label of a vertex of the graph. Mod sum graph is the promotion of sum graph, and it’s very important in graph theory. This paper provides a mod sum labeling for the generalized friendship graph with the sequential numbering method. To develop our labeling scheme we first consider the case \( m = 3,4,5 \) before proving the result for the general case by considering both odd and even cycles. Finally, to prove all the generalized friendship graphs are mod sum graphs. This conclusion is further improved the theory of the labeled graph, and to provide a theoretical basis for later researchers.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Bondy JA, Murty USR (1976) Graph theory with applications, vol 12. MacMillan, NewYork, pp 09–16
Harary F (1994) Sum graphs over all the integers. Discrete Math 124:99–105
Miller M, Slamin JR, Smyth WF (1998) Labeling wheels for minimum sum number. JCMCC 28:289–297
Bolland J, Laskar R, urner CT, Domke G (1990) On mod sum graphs. Congressus Numerantium 70:131–135
Miller M, Sutton M (1999) Mod sum graph labelling of \( {\text{H}}m,n\psi \) and \( {\text{K}}n ,\) Australas J Combinatorics 20:233–240
Dou W, Gao J (2006) The (mod, integral) sum numbers of fans and \( K_{n,n} - E(nK_{2} ) ,\) Discrete Math 306:2665–2669
Fernau H, Ryan JF, Sugeng KA (2009) A sum labelling for the generalised friendship graph. Discrete Math 308:734–740
Shi D, Li W, Zhang T (2007) Some new results on mod sum graph. J Heilongjiang Inst Sci Technol 17:305–308
Acknowledgments
Funded Projects: Heilongjiang Provincial Education Office of scientific research project (12523046).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag London
About this paper
Cite this paper
Shi, D., Li, W., Zhang, Q., Pan, X. (2013). Efficient Mod Sum Labeling Scheme of Generalized Friendship Graph. In: Du, W. (eds) Informatics and Management Science II. Lecture Notes in Electrical Engineering, vol 205. Springer, London. https://doi.org/10.1007/978-1-4471-4811-1_1
Download citation
DOI: https://doi.org/10.1007/978-1-4471-4811-1_1
Published:
Publisher Name: Springer, London
Print ISBN: 978-1-4471-4810-4
Online ISBN: 978-1-4471-4811-1
eBook Packages: EngineeringEngineering (R0)