Combinatorial labelings of graphs
| dc.contributor.author | Hegde, S.M. | |
| dc.contributor.author | Shetty, S. | |
| dc.date.accessioned | 2020-03-31T08:18:47Z | |
| dc.date.available | 2020-03-31T08:18:47Z | |
| dc.date.issued | 2006 | |
| dc.description.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. | en_US |
| dc.identifier.citation | Applied Mathematics E - Notes, 2006, Vol.6, , pp.251-258 | en_US |
| dc.identifier.uri | https://idr.nitk.ac.in/handle/123456789/10249 | |
| dc.title | Combinatorial labelings of graphs | en_US |
| dc.type | Article | en_US |
Files
Original bundle
1 - 1 of 1
- Name:
- 8 Combinatorial Labelings Of Graphs.pdf
- Size:
- 235.27 KB
- Format:
- Adobe Portable Document Format