On \(n\)th order degree regular trees (Q1901617): Difference between revisions

Let \(G\) be a finite graph. The \(n\)th order degree of a vertex \(v\) in \(G\), denoted by \(\deg_n v\), is defined as the number of vertices at distance \(n\) from \(v\). For a positive integer \(k\), the graph is said to be \(n\)th order regular of degree \(k\) if for any vertex \(v\) of \(G\) it holds \(\deg_n v = k\). \(G\) is defined to be \(n\)th order degree regular if \(G\) is \(n\)th order regular of degree \(k\) for some \(k \geq 1\). The paper proves that for \(n \geq 2\), if \(G\) is a tree which is \(n\)th order regular of degree 2, then the diameter of \(G\) is \(2n - 1\). Additionally, a characterization of \(n\)th order degree regular trees for \(n\) between 2 and 6 is given.