A new method for the sum-edge characteristic polynomials of graphs

DOI10.5269/BSPM.47918OpenAlexW4210557623MaRDI QIDQ6189579

Ismail Naci Cangul, Mert Sinan Oz

Publication date: 8 February 2024

Published in: Boletim da Sociedade Paranaense de Matemática (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.5269/bspm.47918

zbMATH Keywords

characteristic polynomialpermutationgraphsadjacencysum-edge adjacency

Mathematics Subject Classification ID

Graph polynomials (05C31) Enumeration in graph theory (05C30) Paths and cycles (05C38) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Vertex degrees (05C07)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Remarks on the energy of regular graphs
• Spectra of graphs
• On Laplacian energy, Laplacian-energy-like invariant and Kirchhoff index of graphs
• Degree-based energies of graphs
• Lower bounds of graph energy in terms of matching number
• Energy, matching number and odd cycles of graphs
• On the sum of the \(k\) largest eigenvalues of graphs and maximal energy of bipartite graphs
• Inverses of triangular matrices and bipartite graphs
• Graph Energy
• Graph-Theoretical Matrices in Chemistry

This page was built for publication: A new method for the sum-edge characteristic polynomials of graphs