A connection between ordinary and Laplacian spectra of bipartite graphs

From MaRDI portal
Revision as of 22:51, 4 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3502320

DOI10.1080/03081080601002254zbMath1163.05043OpenAlexW1991418932MaRDI QIDQ3502320

Bo Zhou, Ivan Gutman

Publication date: 23 May 2008

Published in: Linear and Multilinear Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03081080601002254




Related Items (37)

Laplacian coefficient, matching polynomial and incidence energy of trees with described maximum degreeLaplacian immanantal polynomials and the \(\mathsf{GTS}\) poset on treesOn incidence energy of a graphOn extremal bipartite bicyclic graphsOn the Laplacian coefficients of acyclic graphsA relation between the Laplacian and signless Laplacian eigenvalues of a graphOn the Kirchhoff index of the complement of a bipartite graphThe normalized incidence energy of a graphCoulson-type integral formulas for the general Laplacian-energy-like invariant of graphs. I.The coefficients of Laplacian characteristic polynomials of graphsSeveral improved asymptotic normality criteria and their applications to graph polynomialsLaplacian coefficients of trees with a given bipartitionThe smallest signless Laplacian spectral radius of graphs with a given clique numberOn the signless Laplacian coefficients of unicyclic graphsOn the Laplacian coefficients of graphs under some transformationsOn the Laplacian coefficients and Laplacian-like energy of unicyclic graphs with \(n\) vertices and \(m\) pendant verticesOn the nullity of the line graph of unicyclic graph with depth oneSome results on signless Laplacian coefficients of graphsOn extremal bipartite unicyclic graphsOn the Laplacian coefficients of trees with a perfect matchingThe signless Laplacian or adjacency spectral radius of bicyclic graphs with given number of cut edgesEach \((n,m)\)-graph having the \(i\)-th minimal Laplacian coefficient is a threshold graphOn sum of powers of the Laplacian eigenvalues of graphsTowards a spectral theory of graphs based on the signless Laplacian. II.On the Laplacian coefficients of unicyclic graphs with prescribed matching numberOn the Laplacian coefficients of tricyclic graphsOrdering of trees with fixed matching number by the Laplacian coefficientsAsymptotic normality of Laplacian coefficients of graphsTrees with minimal Laplacian coefficientsOn the Laplacian coefficients and Laplacian-like energy of bicyclic graphsLaplacian coefficients of trees with given number of leaves or vertices of degree twoOn the ordering of trees by the Laplacian coefficientsOn the Laplacian coefficients of unicyclic graphsA note on sum of powers of the Laplacian eigenvalues of bipartite graphsOrdering trees by the Laplacian coefficientsOn a Poset of Trees IIOn the Laplacian coefficients of signed graphs




Cites Work




This page was built for publication: A connection between ordinary and Laplacian spectra of bipartite graphs