Abstract
In this paper we determine that integral sum number of graph C n , namely for any integer n ≥ 5, then ξ(C n )=0, therefore we prove that the graph C n (n ≥ 5) is an integral sum graph.
Chapter PDF
References
Harary, F.: Graph Theory. Addison-Wesley, Reading (1969)
Bondy, J.A., Murty, U.S.R.: Graph Theory with Applications. Elsevier North-Holland (1976)
Harary, F.: Sum graphs over all the integers. Discrete Math. (124), 99–105 (1994)
Xu, B.: On integral sum graphs. Discrete Math. (194), 285–294 (1999)
Achaya, B.D., Hegde, S.M.: Arithmetic graphs. Journal of Graph Theory 18(3), 275–299 (1990)
Yu, H.: The Windmill \({{{W} ^*}_n}\) is the intergral sum Graph and Mod intergral sum Graph. Journal of Heze University 28(3), 18–19 (2006)
Gao, X.-L.: Several kinds Interal Sum Tree. Journal of Dezhou University 17(2), 18–22 (2011)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 IFIP International Federation for Information Processing
About this paper
Cite this paper
Liu, E., Zhou, Q., Yu, W. (2012). On Integral Sum Numbers of Cycles. In: Li, D., Chen, Y. (eds) Computer and Computing Technologies in Agriculture V. CCTA 2011. IFIP Advances in Information and Communication Technology, vol 370. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-27275-2_15
Download citation
DOI: https://doi.org/10.1007/978-3-642-27275-2_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-27274-5
Online ISBN: 978-3-642-27275-2
eBook Packages: Computer ScienceComputer Science (R0)