Name
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. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1016/j.disc.2009.05.028 | Discrete Mathematics |
Keywords | Field | DocType |
vertex dependent characteristic,strongly k -indexable graphs/labelings,strongly k-indexable graphs/labelings,indexation,arithmetic progression | Discrete mathematics,Graph,Strongly regular graph,Polygon,Combinatorics,Indifference graph,Vertex (geometry),Plane (geometry),Chordal graph,Mathematics,Arithmetic progression | Journal |
Volume | Issue | ISSN |
309 | 21 | Discrete Mathematics |
Citations | PageRank | References |
0 | 0.34 | 4 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| S. M. Hegde | 1 | 32 | 9.96 |
| Sudhakar Shetty | 2 | 0 | 1.01 |