Network similarity measure and Ediz eccentric connectivity index

DOI10.1155/2020/2567570zbMath1454.05027OpenAlexW3108831692MaRDI QIDQ2225483

Guihai Yu, Xinzhuang Chen

Publication date: 8 February 2021

Published in: Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2020/2567570

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Distance in graphs (05C12) Connectivity (05C40) Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Characterizing graphs with maximal Laplacian Estrada index
• On the eccentric distance sum of graphs
• On Estrada index of trees
• Graph distance measures based on topological indices revisited
• On the minimal eccentric connectivity indices of graphs
• New inequalities for network distance measures by using graph spectra
• On the generalized Wiener polarity index of trees with a given diameter
• Fifty years of graph matching, network alignment and network comparison
• On the extended Estrada index of some graphs
• A comparative analysis of new graph distance measures and graph edit distance
• On two eccentricity-based topological indices of graphs
• Graph Energy
• The minimal Kirchhoff index of graphs with a given number of cut vertices

This page was built for publication: Network similarity measure and Ediz eccentric connectivity index