arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1403.2846math.CO
收藏

图的Q- generating function及其应用

The Q-generating function for graphs with application

Shu-Yu Cui, Gui-Xian Tian

摘要:

对于简单连通图$G$,定义了$G$中长度为$k$的半边游动个数$N_k$的$Q$ -生成函数为$W_Q(t)=\sum\nolimits_{k = 0}^\infty {N_k t^k }$ .本文揭示了$Q$生成函数$W_Q(t)$可用图$G$及其补图$\overline{G}$的$Q$多项式表示.利用这一结果,我们研究了图的$Q$ -谱性质,并计算了一些图的$Q$ -多项式,这些图是通过图的补图、图的并图、图的(边)冠等操作得到的.作为$Q$ -生成函数$W_Q(t)$的另一个应用,我们还给出了$G$的$Q$ -冠的组合解释,它被定义为矩阵$(λI_n-Q(G))^{-1}$的元素之和。这一结果可用于两个图的(边)冠的$Q$ -多项式的许多替代计算。此外,我们还计算了两个图的并图和完全多部图的$Q$ -冠。

英文摘要:

For a simple connected graph $G$, the $Q$-generating function of the numbers $N_k$ of semi-edge walks of length $k$ in $G$ is defined by $W_Q(t)=\sum\nolimits_{k = 0}^\infty {N_k t^k }$. This paper reveals that the $Q$-generating function $W_Q(t)$ may be expressed in terms of the $Q$-polynomials of the graph $G$ and its complement $\overline{G}$. 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 $W_Q(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 $(λI_n-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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑