On the Laplacian coefficients of trees with a perfect matching
DOI10.1016/J.LAA.2011.07.038zbMATH Open1236.05125OpenAlexW2029034344MaRDI QIDQ649560FDOQ649560
Authors: Shangwang Tan, Tian-Mei Song
Publication date: 2 December 2011
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2011.07.038
Recommendations
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Signless Laplacians of finite graphs
- Title not available (Why is that?)
- Ordering trees by the Laplacian coefficients
- On the second largest Laplacian eigenvalue of trees
- Connections between Wiener index and matchings
- A connection between ordinary and Laplacian spectra of bipartite graphs
- Incidence energy of a graph
- On incidence energy of graphs
- On the Laplacian coefficients of unicyclic graphs with prescribed matching number
- Wiener index of trees: Theory and applications
- On the ordering of trees by the Laplacian coefficients
- On the Laplacian coefficients of acyclic graphs
- Trees with minimal Laplacian coefficients
- Title not available (Why is that?)
- Starlike trees are determined by their Laplacian spectrum
- Title not available (Why is that?)
- A survey of graph laplacians
- On incidence energy of a graph
- Title not available (Why is that?)
- On Laplacian like energy of trees
- Ordering of trees with fixed matching number by the Laplacian coefficients
- Laplacian coefficients of trees with given number of leaves or vertices of degree two
- Laplacian-like energy of trees
- On the coefficients of the Laplacian characteristic polynomial of trees
- Minimum on Wiener indices of trees and unicyclic graphs of the given matching number
- Laplacian coefficients of trees with a given bipartition
Cited In (16)
- Laplacian coefficients of trees
- Laplacian coefficient, matching polynomial and incidence energy of trees with described maximum degree
- Ordering of trees with fixed matching number by the Laplacian coefficients
- Trees with minimal Laplacian coefficients
- Laplacian coefficients of trees with given number of leaves or vertices of degree two
- Note on the \(k\)th Laplacian eigenvalues of trees with perfect matchings
- Laplacian immanantal polynomials and the \(\mathsf{GTS}\) poset on trees
- The signless Laplacian coefficients and incidence energy of bicyclic graphs
- On the \(k\)th Laplacian eigenvalues of trees with perfect matchings
- On a poset of trees revisited
- On \(\alpha\)-labellings of lobsters and trees with a perfect matching
- Matchings on trees and the adjacency matrix: A determinantal viewpoint
- When (signless) Laplacian coefficients meet matchings of subdivision
- Title not available (Why is that?)
- Ordering trees with given matching number by their Wiener indices
- On the Laplacian coefficients of graphs under some transformations
This page was built for publication: On the Laplacian coefficients of trees with a perfect matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q649560)