Fast algorithms for indices of nested split graphs approximating real complex networks

DOI10.1016/j.dam.2018.03.054zbMath1394.05125arXiv1803.00306OpenAlexW2964076558MaRDI QIDQ1671330

Irene Sciriha, Mark Debono, Johann A. Briffa

Publication date: 6 September 2018

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

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

zbMATH Keywords

Markov chainssimulated annealingHamming distanceWiener indexShannon entropythreshold graphSzeged indexEstrada indexRandić indexnested split graphresolvent energyGutman graph energy

Mathematics Subject Classification ID

Applications of graph theory (05C90) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85) Vertex degrees (05C07)

Related Items

THE DOMINATION GAME ON SPLIT GRAPHS, On the displacement of eigenvalues when removing a twin vertex

Cites Work

• On the spectrum of threshold graphs
• A history of graph entropy measures
• Randić index and the diameter of a graph
• On the construction of graphs of nullity one
• On the difference between the Szeged and the Wiener index
• Threshold graphs and related topics
• Estimating the Estrada index
• Graph Energy
• Mathematical aspects of Wiener index
• A characterization of singular graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item