The \(k\)-distance neighborhood polynomial of some graph operations (Q527345): Difference between revisions

Summary: The \(k\)-distance neighborhood polynomial (\(N_k\)-polynomial) of a graph \(G\) defined as \(N_k(G, x)= \sum\limits_{k=0}^{\mathrm{diam}(G)} \left(\sum\limits_{i=1}^{n}d_k(v_i)\right) x^k,\) where \(\mathrm{diam}(G)\) is the diameter of \(G\) and \(d_k(v)=|\{u\in V(G): d(v, u)=k\}|\). \(N_k\)-polynomial of a graph \(G\) is the ordinary generating function for the number of \(k\)-distance neighborhood of the vertices of \(G\). In this paper, exact formulas of the \(N_k\)-polynomial for corona product and union of two graphs are presented. It is shown that for any graph \(G\) of order \(n\) size \(m\) and \(\mathrm{diam}(G)=2\), \(N_k(G,x)=n+2mx+(n^2-n-2m)x^2\). Also, the \(N_k\)-polynomials of the complement graph \(\overline{G}\) of some graph \(G\) are obtained.