Please use this identifier to cite or link to this item: http://idr.nitk.ac.in/jspui/handle/123456789/10249
Full metadata record
DC FieldValueLanguage
dc.contributor.authorHegde, S.M.-
dc.contributor.authorShetty, S.-
dc.date.accessioned2020-03-31T08:18:47Z-
dc.date.available2020-03-31T08:18:47Z-
dc.date.issued2006-
dc.identifier.citationApplied Mathematics E - Notes, 2006, Vol.6, , pp.251-258en_US
dc.identifier.urihttp://idr.nitk.ac.in/jspui/handle/123456789/10249-
dc.description.abstractA (p, g)-graph G is said to be a permutation (combination) graph if G admits an assignment of distinct integers 1, 2, 3, ..., p to the vertices such that edge values obtained by the number of permutations (combinations) of larger vertex value taken smaller vertex value at a time are distinct. In this paper we obtain a necessary condition for combination graph and study structure of permutation and combination graphs which includes some open problems.en_US
dc.titleCombinatorial labelings of graphsen_US
dc.typeArticleen_US
Appears in Collections:1. Journal Articles

Files in This Item:
File Description SizeFormat 
8 Combinatorial Labelings Of Graphs.pdf235.27 kBAdobe PDFThumbnail
View/Open


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