Abstract
Let be a graph with vertices, and let and be the Laplacian matrix and signless Laplacian matrix of , respectively. The polynomial (resp. ) is called {\em Laplacian permanental polynomial} (resp. {\em signless Laplacian permanental polynomial}) of . In this paper, we show that two classes of bicyclic graphs are determined by their (signless) Laplacian permanental polynomials.
Connections
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 review
No reviews yet.
Discussion 0
Add a comment
No comments yet.