The characterizing properties of (signless) Laplacian permanental polynomials of bicyclic graphs
Abstract
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)= per(xI-L(G)) (resp. π(Q(G);x)= per(xI-Q(G))) is called Laplacian permanental polynomial (resp. 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.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.