• M. Saranya
• Mr.M.V. Suresh

The degree/distance across an issue for coordinated charts is the issue of deciding the biggest conceivable request for a digraph with given greatest out-degree d and width k. An upper bound is given by the Moore bound M (d, k) = and nearly Moore digraphs will be digraphs with most extreme out-degree d, the distance across k, and request M (d, k)- 1. In this paper, we will take a gander at the structure of subdigraphs of nearly Moore digraphs, which are initiated by the vertices fixed by some automorphism ϕ. In the event that the automorphism fixes at any rate three vertices, we demonstrate that the instigated subdigraph is either a nearly Moore digraph or an ordinary k-geodetic digraph of degree , request and breadth k + 1. As it is realized that nearly Moore digraphs have an automorphism r, these outcomes can enable us to decide basic properties of nearly Moore digraphs, for example, what number of vertices of each request there are concerning r. We decide this for d = 4 and d = 5, where we demonstrate that with the exception of in some uncommon cases, all vertices will have a similar request.

k-geodetic digraph; Moore digraph; the degree/breadth issue

"SUBDIGRAPHS OF NEARLY MOORE DIGRAPHS INITIATED BY FIXPOINTS OF AN AUTOMORPHISM", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.6, Issue 6, page no.714-720, June-2019, Available :http://www.jetir.org/papers/JETIR1906D14.pdf

"SUBDIGRAPHS OF NEARLY MOORE DIGRAPHS INITIATED BY FIXPOINTS OF AN AUTOMORPHISM", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.6, Issue 6, page no. pp714-720, June-2019, Available at : http://www.jetir.org/papers/JETIR1906D14.pdf