Some unicyclic graphs determined by the signless Laplacian permanental polynomial

DOI10.1007/S12190-024-02082-8MaRDI QIDQ6586106zbMATH OpenFDO

Authors Pratima Panigrahi, S. K. Panda

Publication date 12 August 2024

Published in Journal of Applied Mathematics and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S12190-024-02082-8

zbMATH Keywords

pendant starpermanentsignless Laplacian permanental polynomialstar degreeunicyclic graph

Mathematics Subject Classification ID

Graph polynomials (05C31) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Determinants, permanents, traces, other special matrix functions (15A15)

Cites work

• A study on determination of some graphs by Laplacian and signless Laplacian permanental polynomials
• Computing the permanental polynomials of graphs
• Further results on the star degree of graphs
• Highly unique network descriptors based on the roots of the permanental polynomial
• Multiplicity of integer roots of polynomials of graphs
• On the (signless) Laplacian permanental polynomials of graphs
• Permanental bounds for the signless Laplacian matrix of a unicyclic graph with diameter d
• Permanental bounds for the signless Laplacian matrix of bipartite graphs and unicyclic graphs
• Permanental roots and the star degree of a graph
• The coefficients of the immanantal polynomial

This page was built for publication: Some unicyclic graphs determined by the signless Laplacian permanental polynomial

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6586106)