The Q-generating function for graphs with application

From MaRDI portal
Publication:2021601



Abstract: For a simple connected graph G, the Q-generating function of the numbers Nk of semi-edge walks of length k in G is defined by WQ(t)=sumolimitsk=0inftyNktk. This paper reveals that the Q-generating function WQ(t) may be expressed in terms of the Q-polynomials of the graph G and its complement overlineG. Using this result, we study some Q-spectral properties of graphs and compute the Q-polynomials for some graphs obtained by the use of some operation on graphs, such as the complement graph of a regular graph, the join of two graphs, the (edge)corona of two graphs and so forth. As another application of the Q-generating function WQ(t), we also give a combinatorial interpretation of the Q-coronal of G, which is defined to be the sum of the entries of the matrix (lambdaIn−Q(G))−1. This result may be used to obtain the many alternative calculations of the Q-polynomials of the (edge)corona of two graphs. Further, we also compute the Q-coronals of the join of two graphs and the complete multipartite graphs.












This page was built for publication: The \(Q\)-generating function for graphs with application

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2021601)