When (signless) Laplacian coefficients meet matchings of subdivision

DOI10.1016/J.EJC.2024.104087MaRDI QIDQ6655709zbMATH OpenFDO

Authors Zhibin Du

Publication date 27 December 2024

Published in European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.EJC.2024.104087

zbMATH Keywords

graph spectraLaplacian matrixline graphmatching polynomialsignless Laplacianstar complement

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• On the Laplacian coefficients of signed graphs
• Combinatorial explanation of coefficients of the Laplacian matching polynomial of graphs
• On the Kirchhoff index of a graph and the matchings of the subdivision
• Laplacian coefficients of trees
• Ordering of trees with fixed matching number by the Laplacian coefficients

Cites work

• A certain polynomial of a graph and graphs with an extremal number of trees
• A connection between ordinary and Laplacian spectra of bipartite graphs
• A survey of graph laplacians
• An analog of matrix tree theorem for signless Laplacians
• Coefficients of the characteristic polynomial of the (signless, normalized) Laplacian of a graph
• Connections between Wiener index and matchings
• Laplacian coefficient, matching polynomial and incidence energy of trees with described maximum degree
• Laplacian coefficients of trees with a given bipartition
• Laplacian coefficients of trees with given number of leaves or vertices of degree two
• On the Kirchhoff index of a unicyclic graph and the matchings of the subdivision
• On the Laplacian coefficients of acyclic graphs
• On the Laplacian coefficients of bicyclic graphs
• On the Laplacian coefficients of graphs under some transformations
• On the Laplacian coefficients of trees with a perfect matching
• On the Laplacian coefficients of tricyclic graphs
• On the Laplacian coefficients of unicyclic graphs
• On the Laplacian coefficients of unicyclic graphs with prescribed matching number
• On the ordering of trees by the Laplacian coefficients
• On the signless Laplacian coefficients of unicyclic graphs
• Ordering of trees with fixed matching number by the Laplacian coefficients
• Ordering trees by the Laplacian coefficients
• Signless Laplacian coefficients and incidence energy of unicyclic graphs with the matching number
• Signless Laplacians of finite graphs
• Some results on signless Laplacian coefficients of graphs
• Spectra of graphs. Theory and application
• The coefficients of Laplacian characteristic polynomials of graphs
• The signless Laplacian coefficients and incidence energy of bicyclic graphs
• Trees with minimal Laplacian coefficients

This page was built for publication: When (signless) Laplacian coefficients meet matchings of subdivision

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