When (signless) Laplacian coefficients meet matchings of subdivision
From MaRDI portal
Publication:6655709
DOI10.1016/J.EJC.2024.104087MaRDI QIDQ6655709
Could not fetch data.
Publication date: 27 December 2024
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Laplacian coefficient, matching polynomial and incidence energy of trees with described maximum degree
- Some results on signless Laplacian coefficients of graphs
- On the Laplacian coefficients of unicyclic graphs with prescribed matching number
- Ordering of trees with fixed matching number by the Laplacian coefficients
- On the Laplacian coefficients of trees with a perfect matching
- On the Laplacian coefficients of bicyclic graphs
- Laplacian coefficients of trees with given number of leaves or vertices of degree two
- On the ordering of trees by the Laplacian coefficients
- On the Laplacian coefficients of acyclic graphs
- Signless Laplacians of finite graphs
- Trees with minimal Laplacian coefficients
- On the Laplacian coefficients of unicyclic graphs
- Ordering trees by the Laplacian coefficients
- A certain polynomial of a graph and graphs with an extremal number of trees
- An analog of matrix tree theorem for signless Laplacians
- Coefficients of the characteristic polynomial of the (signless, normalized) Laplacian of a graph
- On the Kirchhoff index of a unicyclic graph and the matchings of the subdivision
- On the Laplacian coefficients of tricyclic graphs
- The coefficients of Laplacian characteristic polynomials of graphs
- Laplacian coefficients of trees with a given bipartition
- On the signless Laplacian coefficients of unicyclic graphs
- On the Laplacian coefficients of graphs under some transformations
- The signless Laplacian coefficients and incidence energy of bicyclic graphs
- Connections between Wiener index and matchings
- Signless Laplacian coefficients and incidence energy of unicyclic graphs with the matching number
- A connection between ordinary and Laplacian spectra of bipartite graphs
- A survey of graph laplacians
- Spectra of graphs. Theory and application
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)