A connection between ordinary and Laplacian spectra of bipartite graphs
From MaRDI portal
Recommendations
- Spectra of some special bipartite graphs
- Laplacian and signless Laplacian characteristic polynomial of generalized subdivision corona vertex graph.
- Spectra of subdivision-vertex join and subdivision-edge join of two graphs
- The generalized characteristic polynomial of the subdivision-vertex and subdivision-edge coronae.
- Adjacency and Laplacian spectrum of a class of generalized corona.
Cites work
Cited in
(45)- On the Laplacian coefficients of unicyclic graphs
- A note on sum of powers of the Laplacian eigenvalues of bipartite graphs
- Ordering trees by the Laplacian coefficients
- When can the components of NEPS of connected bipartite graphs be almost cospectral?
- Laplacian immanantal polynomials and the \(\mathsf{GTS}\) poset on trees
- On the Laplacian coefficients and Laplacian-like energy of unicyclic graphs with n vertices and m pendant vertices
- Asymptotic normality of Laplacian coefficients of graphs
- Each (n,m)-graph having the i-th minimal Laplacian coefficient is a threshold graph
- On the Laplacian coefficients of tricyclic graphs
- On the Laplacian coefficients of signed graphs
- The coefficients of Laplacian characteristic polynomials of graphs
- Laplacian coefficients of trees with a given bipartition
- The smallest signless Laplacian spectral radius of graphs with a given clique number
- On the signless Laplacian coefficients of unicyclic graphs
- On the Laplacian coefficients of graphs under some transformations
- On extremal bipartite unicyclic graphs
- Spectral bisection of graphs and connectedness
- On extremal bipartite bicyclic graphs
- Laplacian coefficient, matching polynomial and incidence energy of trees with described maximum degree
- Several improved asymptotic normality criteria and their applications to graph polynomials
- On a poset of trees. II
- On the Kirchhoff index of the complement of a bipartite graph
- The normalized incidence energy of a graph
- On the nullity of the line graph of unicyclic graph with depth one
- Some results on signless Laplacian coefficients of graphs
- The signless Laplacian or adjacency spectral radius of bicyclic graphs with given number of cut edges
- On the Laplacian coefficients and Laplacian-like energy of bicyclic graphs
- On the Laplacian coefficients of unicyclic graphs with prescribed matching number
- Ordering of trees with fixed matching number by the Laplacian coefficients
- On sum of powers of the Laplacian eigenvalues of graphs
- A relation between the Laplacian and signless Laplacian eigenvalues of a graph
- On the Laplacian coefficients of trees with a perfect matching
- When (signless) Laplacian coefficients meet matchings of subdivision
- On the Laplacian coefficients of trees
- The Laplacian characteristic polynomial of the path-tree of the complete graph
- Subdivision method in the Laplacian matching polynomial
- Graphs with the minimal Laplacian coefficients
- Csikvári's poset and Tutte polynomial
- Laplacian coefficients of trees with given number of leaves or vertices of degree two
- On the ordering of trees by the Laplacian coefficients
- On incidence energy of a graph
- On the Laplacian coefficients of acyclic graphs
- Coulson-type integral formulas for the general Laplacian-energy-like invariant of graphs. I.
- Towards a spectral theory of graphs based on the signless Laplacian. II.
- Trees with minimal Laplacian coefficients
This page was built for publication: A connection between ordinary and Laplacian spectra of bipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3502320)