A new method for the sum-edge characteristic polynomials of graphs
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 3966122
- On the characteristic polynomials of covering number of vertices and edges of graphs
- scientific article; zbMATH DE number 7540090
- Two graphs with a common edge
- A new method to compute the determinantal polynomial coefficients of a matrix (symmetric normalized Kirchhoff matrix) of a complete graph
Cites work
- Degree-based energies of graphs
- Energy, matching number and odd cycles of graphs
- Graph energy
- Graph-Theoretical Matrices in Chemistry
- scientific article; zbMATH DE number 3717357 (Why is no real title available?)
- scientific article; zbMATH DE number 3445271 (Why is no real title available?)
- scientific article; zbMATH DE number 7055814 (Why is no real title available?)
- Inverses of triangular matrices and bipartite graphs
- Lower bounds of graph energy in terms of matching number
- On Laplacian energy, Laplacian-energy-like invariant and Kirchhoff index of graphs
- On the sum of the \(k\) largest eigenvalues of graphs and maximal energy of bipartite graphs
- Remarks on the energy of regular graphs
- Spectra of graphs
This page was built for publication: A new method for the sum-edge characteristic polynomials of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6189579)
