Please use this identifier to cite or link to this item: http://idr.nitk.ac.in/jspui/handle/123456789/8607
Full metadata record
DC FieldValueLanguage
dc.contributor.authorHegde, S.M.
dc.date.accessioned2020-03-30T10:22:28Z-
dc.date.available2020-03-30T10:22:28Z-
dc.date.issued2008
dc.identifier.citationJournal of Combinatorial Mathematics and Combinatorial Computing, 2008, Vol.65, , pp.181-195en_US
dc.identifier.urihttp://idr.nitk.ac.in/jspui/handle/123456789/8607-
dc.description.abstractA (p, q)-graph G is said to be multiplicative if its vertices can be assigned distinct positive integers so that the values of the edges, obtained as the products of the numbers assigned to their end vertices are all distinct. Such an assignment is called a multiplicative labeling of G. A multiplicative labeling is said to be (a, r)-geometric if the values of the edges, can be arranged as a geometric progression a, ar, ar2,..., arq-1. In this paper we prove that some well known classes of graphs are geometric for certain values of a,r and also initiate a study on the structure of finite (a,r)-geometric graphs.en_US
dc.titleOn multiplicative labelings of a graphen_US
dc.typeBook chapteren_US
Appears in Collections:2. Conference Papers

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.