Productive and sum graph labelings: A survey

Please use this identifier to cite or link to this item: https://idr.nitk.ac.in/jspui/handle/123456789/14642

Full metadata record

DC Field	Value	Language
dc.contributor.author	Beineke L.W.
dc.contributor.author	Hegde S.M.
dc.contributor.author	Vilfred Kamalappan V.
dc.date.accessioned	2021-05-05T10:11:46Z	-
dc.date.available	2021-05-05T10:11:46Z	-
dc.date.issued	2021
dc.identifier.citation	Discrete Mathematics Letters , Vol. 6 , , p. 8 - 18	en_US
dc.identifier.uri	https://doi.org/10.47443/dml.2021.s102
dc.identifier.uri	http://idr.nitk.ac.in/jspui/handle/123456789/14642	-
dc.description.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. © 2021 the authors.	en_US
dc.title	Productive and sum graph labelings: A survey	en_US
dc.type	Review	en_US
Appears in Collections:	5. Miscellaneous Publications

Files in This Item:

There are no files associated with this item.