Fast algorithms for indices of nested split graphs approximating real complex networks (Q1671330)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6933510
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fast algorithms for indices of nested split graphs approximating real complex networks |
scientific article; zbMATH DE number 6933510 |
Statements
Fast algorithms for indices of nested split graphs approximating real complex networks (English)
0 references
6 September 2018
0 references
threshold graph
0 references
nested split graph
0 references
Markov chains
0 references
simulated annealing
0 references
Hamming distance
0 references
Shannon entropy
0 references
Randić index
0 references
Szeged index
0 references
Estrada index
0 references
Wiener index
0 references
Gutman graph energy
0 references
resolvent energy
0 references
0.6949990391731262
0 references
0.694256603717804
0 references
0.6828967928886414
0 references
0.6715538501739502
0 references
0.6712894439697266
0 references
