Laplacian coefficients of trees with a given bipartition
DOI10.1016/J.LAA.2011.01.011zbMATH Open1226.05162OpenAlexW2000341805MaRDI QIDQ2431179FDOQ2431179
Authors: Weiqi Lin, Weigen Yan 
Publication date: 11 April 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.01.011
Recommendations
- Laplacian coefficients of trees with given number of leaves or vertices of degree two
- On the coefficients of the Laplacian characteristic polynomial of trees
- On the Laplacian coefficients of bipartite bicyclic graphs
- Ordering of trees with fixed matching number by the Laplacian coefficients
- Laplacian coefficients of trees
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Trees (05C05) Partitions of sets (05A18) Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Graph theory
- Title not available (Why is that?)
- On the Laplacian coefficients of unicyclic graphs
- Ordering trees by the Laplacian coefficients
- A connection between ordinary and Laplacian spectra of bipartite graphs
- Title not available (Why is that?)
- On the ordering of trees by the Laplacian coefficients
- On the Laplacian coefficients of acyclic graphs
- Trees with minimal Laplacian coefficients
- On acyclic conjugated molecules with minimal energies
- Title not available (Why is that?)
- Laplacian coefficients of trees with given number of leaves or vertices of degree two
- Laplacian-like energy of trees
- Minimal energy of bipartite unicyclic graphs of a given bipartition
- Reverse Wiener indices of connected graphs
Cited In (16)
- On the coefficients of the Laplacian characteristic polynomial of trees
- On the Laplacian coefficients and Laplacian-like energy of bicyclic graphs
- Laplacian coefficients of trees with given number of leaves or vertices of degree two
- Each \((n,m)\)-graph having the \(i\)-th minimal Laplacian coefficient is a threshold graph
- On the bipartition numbers of random trees. II
- The coefficients of Laplacian characteristic polynomials of graphs
- Further results on the distance spectral radius of graphs
- Computing some Laplacian coefficients of forests
- On the Laplacian coefficients of bipartite bicyclic graphs
- When (signless) Laplacian coefficients meet matchings of subdivision
- On the Laplacian coefficients of tricyclic graphs
- On the Laplacian coefficients and Laplacian-like energy of unicyclic graphs with \(n\) vertices and \(m\) pendant vertices
- On the Laplacian coefficients of trees with a perfect matching
- The signless Laplacian coefficients and the incidence energy of graphs with a given bipartition
- On the Laplacian coefficients of graphs under some transformations
- Laplacian coefficients and Zagreb indices of trees
This page was built for publication: Laplacian coefficients of trees with a given bipartition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2431179)
