No Detail Found!

Productive and sum graph labelings: a survey

Author(s)
Lowell W. Beineke Department of Mathematical Sciences, Purdue University Fort Wayne,Fort Wayne, Indiana,USA
Suresh M. Hegde Department of Mathematical and Computational Sciences, National Institute of Technology Karnataka,Surathkal, Mangalore,India
V. Vilfred Kamalappan Department of Mathematics, Central University of Kerala,Kasaragod, Kerala,India
Abstract
Graph labeling is one of the most popular and dynamic areas of graph theory, perhaps even among all of mathematics. The standard problem involves a graph having labels from a given set of integers on its vertices and then are assigned values according to some formula. Frank Harary introduced an alternative problem, in which the labels on the vertices themselves must meet a specified condition. Here, we give a survey of a problem of each type: (a) strongly multiplicative graphs, where, given a labeling of the vertices, each edge is labeled with the product of its vertex labels; (b) sum graphs, where, given a labeling of the vertices, two are adjacent if the sum of their labels is also a vertex label.
Publication Details
Page(s) 8-18
Published Journal: Discrete Mathematics Letters, Volume: 6, Issue: 0, Year: 2021

Request the full text from PASTIC

Keywords
strongly quotient graphs, productive graphs, strongly multiplicative graphs, graph labelings, integral sum graphs, sum graphs
References
Acharya B. D.,Hegde S. M. .1991 .On certain vertex valuations of a graph. Indian J. Pure Appl, 22 : 553-560.
Adiga C.,Smitha M. .2006 .An upper bound for maximum number of edges in a strongly multiplicative graph. Discuss. Math. Graph Theory, 26 : .
Adiga C.,Zaferani R. K.,Smitha M. . .. South East Asian J. Math., 5 : 119-127.
Beineke L. W.,Hegde S. M. .2001 .. Discuss. Math. Graph Theory, 21 : 63-76.
Beineke L. W.,Seoud M. A. .1998 .On the strong multiplicativity of powers of paths, Congr. , 131 : 211-217.
Bergstrand D.,Hodges K.,Jennings G.,Kuklinski L.,Wiener J.,Harary F. .1989 .The sum number of a complete graph. Bull. Malaysian Math. Soc, 12 : 25-28.
Ellingham M. N. .1993 .Sum graphs from trees. Ars Combin, 35 : 335-349.
Erdo P. .1960 .˝s, An asymptotic inequality in the theory of numbers. , 15 : 41-49.
Gallian J. A.,J. Combin. J. A. .2019 .A dynamic survey of graph labeling, Electron. , : DS6.
Graham R. L.,Sloane N. J. A. .1980 .On additive bases and harmonious graphs. SIAM J. Algebr. Discrete Methods, 1 : 382-404.
Hegde S. M.,Shankaran P. .2008 .Geometric labeled graphs. AKCE J. Graphs Combin, 5 : 83-97.
Harary F. .1990 .Sum graphs and difference graphs. Congr. Numer, 72 : 101-108.
Harary F. .1994 .Sum graphs over all integers. , 124 : 99-105.
Kafshgar R.,Zaferani R. .2005 .The maximum number of edges in a strongly multiplicative graph. Bull. Iranian Math. Soc, 31 : 53-56.
Ringel G. .1964 .. Czech Acad. Sci, 25 : 162.
Rosa A.,N. Y. A. .1967 .On certain valuations of the vertices of a graph. In: Theory of Graphs (Int. Symp. Rome, : 349-355.
Seoud M. A.,Mahran A. E. A. .2015 .On strongly multiplicative graphs. Ars Combin, 118 : 155-165.
Vilfred K.,Beineke L. W.,Suryakala A. .2014 .More properties of sum graphs. Graph Theory Notes N. Y, 66 : 10-15.
Vilfred K.,Florida L. M. .2012 .Integral sum graphs and maximal integral sum graphs. Graph Theory Notes N. Y, 63 : 28-36.
0

Citations

0

Downloads

12

Views