

























Let $G$ be a graph with $n$ vertices, and let $L(G)$ and $Q(G)$ be the Laplacian matrix and signless Laplacian matrix of $G$, respectively. The polynomial $π(L(G);x)={\rm per}(xI-L(G))$ (resp. $π(Q(G);x)={\rm per}(xI-Q(G))$) is called {\em Laplacian permanental polynomial} (resp. {\em signless Laplacian permanental polynomial}) of $G$. In this paper, we show that two classes of bicyclic graphs are determined by their (signless) Laplacian permanental polynomials.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。