Please use this identifier to cite or link to this item:
https://idr.l3.nitk.ac.in/jspui/handle/123456789/13055Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Hegde, S.M. | - |
| dc.contributor.author | Shetty, S. | - |
| dc.date.accessioned | 2020-03-31T08:45:12Z | - |
| dc.date.available | 2020-03-31T08:45:12Z | - |
| dc.date.issued | 2009 | - |
| dc.identifier.citation | Discrete Mathematics, 2009, Vol.309, 21, pp.6160-6168 | en_US |
| dc.identifier.uri | http://idr.nitk.ac.in/jspui/handle/123456789/13055 | - |
| dc.description.abstract | In 1990, Acharya and Hegde introduced the concept of strongly k-indexable graphs: A (p, q)-graph G = (V, E) is said to be stronglyk -indexable if its vertices can be assigned distinct numbers 0, 1, 2, ..., p - 1 so that the values of the edges, obtained as the sums of the numbers assigned to their end vertices form an arithmetic progression k, k + 1, k + 2, ..., k + (q - 1). When k = 1, a strongly k-indexable graph is simply called a strongly indexable graph. In this paper, we report some results on strongly k-indexable graphs and give an application of strongly k-indexable graphs to plane geometry, viz; construction of polygons of same internal angles and sides of distinct lengths. 2009 Elsevier B.V. All rights reserved. | en_US |
| dc.title | Strongly indexable graphs and applications | en_US |
| dc.type | Article | en_US |
| Appears in Collections: | 1. Journal Articles | |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.