The characterizing properties of (signless) Laplacian permanental polynomials of bicyclic graphs

preprint2022arXivOpen access

Abstract

Let GG be a graph with nn vertices, and let L(G)L(G) and Q(G)Q(G) be the Laplacian matrix and signless Laplacian matrix of GG, respectively. The polynomial π(L(G);x)=per(xI−L(G))π(L(G);x)={\rm per}(xI-L(G)) (resp. π(Q(G);x)=per(xI−Q(G))π(Q(G);x)={\rm per}(xI-Q(G))) is called {\em Laplacian permanental polynomial} (resp. {\em signless Laplacian permanental polynomial}) of GG. In this paper, we show that two classes of bicyclic graphs are determined by their (signless) Laplacian permanental polynomials.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.