The characterizing properties of (signless) Laplacian permanental polynomials of bicyclic graphs
Tingzeng Wu, Tian Zhou

TL;DR
This paper investigates the properties of Laplacian and signless Laplacian permanental polynomials in bicyclic graphs, demonstrating that certain classes of these graphs are uniquely identified by these polynomials.
Contribution
It establishes that two classes of bicyclic graphs can be uniquely characterized by their (signless) Laplacian permanental polynomials, a novel identification result.
Findings
Two classes of bicyclic graphs are determined by their (signless) Laplacian permanental polynomials.
The paper provides methods to distinguish these graphs using polynomial invariants.
Results contribute to graph characterization via algebraic invariants.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph theory and applications · Synthesis and Properties of Aromatic Compounds · Advanced Mathematical Theories and Applications
