On conjectures of network distance measures by using graph spectra

DOI10.1016/j.dam.2021.07.006zbMath1469.05105arXiv1912.08412OpenAlexW3184535430WikidataQ122966941 ScholiaQ122966941MaRDI QIDQ2043383

Seyran Azizi, Matthias Dehmer, Aleksandar Ilić, Modjtaba Ghorbani

Publication date: 2 August 2021

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1912.08412

zbMATH Keywords

eigenvaluecharacteristic polynomialgraph entropypath eigenvalue

Mathematics Subject Classification ID

Graph polynomials (05C31) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Evolution of cooperation in the traveler's dilemma game on two coupled lattices
• Line graph eigenvalues and line energy of caterpillars
• Spectral methods for graph clustering - a survey
• Spektren endlicher Grafen
• New inequalities for network distance measures by using graph spectra
• LP formulations of the shortest path tree problem
• Path matrix and path energy of graphs
• Static search games played over graphs and general metric spaces
• The characteristic polynomial of a graph
• On some applications of the selective graph coloring problem
• Continuous quadratic programming formulations of optimization problems on graphs
• Graph Energy
• ON THE PATH MATRICES OF GRAPHS AND THEIR PROPERTIES
• On a certain distance between isomorphism classes of graphs

This page was built for publication: On conjectures of network distance measures by using graph spectra