Please use this identifier to cite or link to this item:
https://idr.l2.nitk.ac.in/jspui/handle/123456789/10249| Title: | Combinatorial labelings of graphs |
| Authors: | Hegde, S.M. Shetty, S. |
| Issue Date: | 2006 |
| Citation: | Applied Mathematics E - Notes, 2006, Vol.6, , pp.251-258 |
| Abstract: | A (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. |
| URI: | http://idr.nitk.ac.in/jspui/handle/123456789/10249 |
| Appears in Collections: | 1. Journal Articles |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| 8 Combinatorial Labelings Of Graphs.pdf | 235.27 kB | Adobe PDF |  View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.