Abstract
A graph G = (V,E) is an integral sum graph if there exists a labeling S(G) ⊂ Z such that V = S(G) and every two distinct vertices u, υ ∈ V are adjacent if and only if u + υ ∈ V. A connected graph G = (V,E) is called unicyclic if |V| = |E|. In this paper two infinite series are constructed of unicyclic graphs that are not integral sum graphs.
Similar content being viewed by others
References
Z. Chen, “Integral Sum Graphs From Identification,” Discrete Math. 181(1–3), 77–90 (1998).
J. A. Gallian, “A Dynamic Survey of Graph Labeling,” http://www.combinatorics.org/Surveys/ds6.pdf.
F. Harary, “Sum Graphs Over All Integers,” Discrete Math. 124(1–3), 99–105 (1994).
S. C. Liaw, D. Kuo, and G. Chang, “Integral Sum Numbers of Graphs,” Ars Combinatoria 54, 259–268 (2000).
L. S. Melnikov and A. V. Pyatkin, “Regular Integral Sum Graphs,” Discrete Math. 252(1–3), 237–245 (2002).
T. Nicholas and S. Somasundaram, “More Results on Integral Sum Graphs,” in Proceedings of National Conference on Graph Theory and Its Applications (Chennai, 2001).
A. Sharary, “Integral Sum Graphs From Complete Graphs, Cycles, and Wheels,” Arab Gulf J. Sci. Res. 14(1), 1–14 (1996).
J. Wu, J. Mao, and D. Li, “New Types of Integral Sum Graphs,” Discrete Math. 260(1–3), 163–176 (2003).
B. Xu, “On Integral Sum Graphs,” Discrete Math. 194(1–3), 285–294 (1999).
Author information
Authors and Affiliations
Corresponding author
Additional information
Original Russian Text © A.V. Pyatkin, 2007, published in Diskretnyi Analiz i Issledovanie Operatsii, Ser. 1, 2007, Vol. 14, No. 2, pp. 16–24.
Rights and permissions
About this article
Cite this article
Pyatkin, A.V. Unicyclic nonintegral sum graphs. J. Appl. Ind. Math. 2, 379–384 (2008). https://doi.org/10.1134/S1990478908030083
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S1990478908030083