The following pages link to Distance in graphs (Q4094890):
Displayed 50 items.
- A sharp lower bound on Steiner Wiener index for trees with given diameter (Q1690239) (← links)
- Inverse problem on the Steiner Wiener index (Q1692631) (← links)
- Graphs whose Wiener index does not change when a specific vertex is removed (Q1701122) (← links)
- Partition distance in graphs (Q1703394) (← links)
- Expected distance based on random walks (Q1708510) (← links)
- Some bounds for the Kirchhoff index of graphs (Q1724990) (← links)
- Infinite family of 3-connected cubic transmission irregular graphs (Q1730230) (← links)
- An upper bound on Wiener indices of maximal planar graphs (Q1732098) (← links)
- On the peripheral Wiener index of graphs (Q1732107) (← links)
- On the difference between the Szeged and the Wiener index (Q1740024) (← links)
- Average distance is submultiplicative and subadditive with respect to the strong product of graphs (Q1740151) (← links)
- On subtrees of trees (Q1775731) (← links)
- Proximity, remoteness and girth in graphs (Q1786868) (← links)
- Graphs preserving total distance upon vertex removal (Q1792072) (← links)
- Superdominance order and distance of trees with bounded maximum degree (Q1861561) (← links)
- A Wiener-type graph invariant for some bipartite graphs (Q1904516) (← links)
- Wiener index of iterated line graphs of trees homeomorphic to \(H\) (Q1945956) (← links)
- On \(\sigma\)-span and \(F\)-span of trees and full binary trees (Q1999724) (← links)
- On graphs whose Wiener complexity equals their order and on Wiener index of asymmetric graphs (Q2001612) (← links)
- Infinite family of 2-connected transmission irregular graphs (Q2007640) (← links)
- On a poset of trees revisited (Q2020047) (← links)
- On the difference of Mostar index and irregularity of graphs (Q2021671) (← links)
- Extremal problems on \(k\)-ary trees with respect to the cover cost and reverse cover cost (Q2032849) (← links)
- Proximity and remoteness in triangle-free and \(C_4\)-free graphs in terms of order and minimum degree (Q2037591) (← links)
- Cut and pendant vertices and the number of connected induced subgraphs of a graph (Q2040982) (← links)
- \(k\)-Wiener index of a \(k\)-plex (Q2075457) (← links)
- Dumbbell graphs with extremal (reverse) cover cost (Q2107445) (← links)
- On the minimum Kirchhoff index of unicyclic graphs with given girth and diameter (Q2134984) (← links)
- On interval transmission irregular graphs (Q2143787) (← links)
- On the relationship between variable Wiener index and variable Szeged index (Q2152719) (← links)
- Minimum status of series-reduced trees with given parameters (Q2160321) (← links)
- Semi-Lipschitz functions and machine learning for discrete dynamical systems on graphs (Q2163223) (← links)
- The upper bounds on the Steiner \(k\)-Wiener index in terms of minimum and maximum degrees (Q2165277) (← links)
- On the difference between proximity and other distance parameters in triangle-free graphs and \(C_4\)-free graphs (Q2172411) (← links)
- Centers of complex networks (Q2177250) (← links)
- On transmission irregular starlike trees (Q2180696) (← links)
- The expected values for the Schultz index, Gutman index, multiplicative degree-Kirchhoff index and additive degree-Kirchhoff index of a random polyphenylene chain (Q2185750) (← links)
- On the (reverse) cover cost of trees with some given parameters (Q2214070) (← links)
- On the status sequences of trees (Q2219062) (← links)
- Which numbers are status differences? (Q2242632) (← links)
- On quartic transmission irregular graphs (Q2242661) (← links)
- The Steiner \(k\)-Wiener index of graphs with given minimum degree (Q2274075) (← links)
- Cospectrality of graphs with respect to distance matrices (Q2279251) (← links)
- Some extremal ratios of the distance and subtree problems in binary trees (Q2279596) (← links)
- Pairs of a tree and a nontree graph with the same status sequence (Q2279985) (← links)
- An inequality between variable Wiener index and variable Szeged index (Q2286073) (← links)
- Stepwise transmission irregular graphs (Q2287698) (← links)
- On the extremal graphs with respect to the total reciprocal edge-eccentricity (Q2292132) (← links)
- The structure of graphs with given number of blocks and the maximum Wiener index (Q2292137) (← links)
- Extremal cover cost and reverse cover cost of trees with given segment sequence (Q2297740) (← links)