On the (signless) Laplacian permanental polynomials of graphs

DOI10.1007/S00373-019-02033-2zbMATH Open1416.05147OpenAlexW2923411950WikidataQ128176935 ScholiaQ128176935MaRDI QIDQ2000570FDOQ2000570

Shunqin Liu

Publication date: 28 June 2019

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-019-02033-2

Recommendations

• The characterizing properties of (signless) Laplacian permanental polynomials of almost complete graphs
• A study on determination of some graphs by Laplacian and signless Laplacian permanental polynomials
• Computing the permanental polynomials of graphs
• scientific article; zbMATH DE number 2116376
• Graphs determined by the (signless) Laplacian permanental polynomials

zbMATH Keywords

coefficient(signless) Laplacian permanental polynomialcopermanental

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph polynomials (05C31)

Cites Work

• Practical graph isomorphism. II.
• Enumeration of cospectral graphs.
• The complexity of computing the permanent
• Permanental polynomials of graphs
• On the characterizing properties of the permanental polynomials of graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Edge-grafting theorems on permanents of the Laplacian matrices of graphs and their applications
• Permanental roots and the star degree of a graph
• Laplacian Permanents of Trees
• Principal subpermanents of the Laplacian matrix
• 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
• Further results on permanental bounds for the Laplacian matrix of trees
• The Laplacian permanental polynomial for trees
• Permanental bounds of the Laplacian matrix of trees with given domination number
• Permanent of the Laplacian matrix of trees and bipartite graphs
• Title not available (Why is that?)
• Tutte uniqueness of line graphs
• Permanent of the Laplacian matrix of trees with a given matching
• Multiplicity of integer roots of polynomials of graphs
• Computing the permanental polynomials of graphs
• Title not available (Why is that?)

Cited In (11)

• The characterizing properties of (signless) Laplacian permanental polynomials of almost complete graphs
• Title not available (Why is that?)
• Some unicyclic graphs determined by the signless Laplacian permanental polynomial
• Permanental bounds for the signless Laplacian matrix of bipartite graphs and unicyclic graphs
• Further results on the star degree of graphs
• Graphs determined by the (signless) Laplacian permanental polynomials
• On the Permanental Polynomial and Permanental Sum of Signed Graphs
• Title not available (Why is that?)
• On the bivariate permanent polynomials of graphs
• On the roots of (signless) Laplacian permanental polynomials of graphs
• A study on determination of some graphs by Laplacian and signless Laplacian permanental polynomials

Uses Software

• nauty
• Traces

This page was built for publication: On the (signless) Laplacian permanental polynomials of graphs

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