• (r, 2, (r-n)(r-1)) - regular graphs
Abstract
A graph G is (r, 2, (r-n)(r - 1)) - regular, for any r ≥ n if each vertex in the graph G is distance one from r vertices and each vertex in the graph G is distance two from exactly (r- n) (r -1) number of vertices. In this paper, we have suggests a method to construct (r, 2, (r-n)(r-1)) - regular graphs, for all r ≥ n ≥ 2.
Keywords
Degree of a graph, Regular graph, Distance, Distance degree regular graphs, (2, k) -regular graphs, k-semiregular graphs.
Full Text:
PDF
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
| © 2010-2022 International Journal of Mathematical Archive (IJMA) Copyright Agreement & Authorship Responsibility |