Pages that link to "Item:Q669403"
From MaRDI portal
The following pages link to Graph distance measures based on topological indices revisited (Q669403):
Displaying 16 items.
- Relations between distance-based and degree-based topological indices (Q670772) (← links)
- New inequalities for network distance measures by using graph spectra (Q1630771) (← links)
- Digraphs with large maximum Wiener index (Q1733463) (← links)
- Counterexamples to conjectures on graph distance measures based on topological indexes (Q1734753) (← links)
- Hosoya entropy of fullerene graphs (Q2010674) (← links)
- Novel results on partial Hosoya polynomials: an application in chemistry (Q2161874) (← links)
- Network similarity measure and Ediz eccentric connectivity index (Q2225483) (← links)
- Comparing large-scale graphs based on quantum probability theory (Q2279341) (← links)
- A note on distance-based entropy of dendrimers (Q2306633) (← links)
- Defining a new graph inefficiency measure for the proportional directional distance function and introducing a new Malmquist productivity index (Q2329498) (← links)
- Graph operations based on using distance-based graph entropies (Q2335167) (← links)
- On the ordering of distance-based invariants of graphs (Q2423150) (← links)
- Connective Steiner 3-eccentricity index and network similarity measure (Q2656671) (← links)
- On the zeros of the partial Hosoya polynomial of graphs (Q2663563) (← links)
- On the relationship between PageRank and automorphisms of a graph (Q6186845) (← links)
- Graph distance measures based on Balaban indices (Q6560778) (← links)
