The following pages link to Mean distance in a graph (Q1239331):
Displaying 50 items.
- Orientations of graphs with maximum Wiener index (Q335342) (← links)
- Graph theory (algorithmic, algebraic, and metric problems) (Q581419) (← links)
- BRS-compactness in networks: Theoretical considerations related to cohesion in citation graphs, collaboration networks and the internet (Q597404) (← links)
- On mean distance and girth (Q608268) (← links)
- Average distance in weighted graphs (Q658013) (← links)
- Some remarks on Wiener index of oriented graphs (Q668528) (← links)
- A new method to find the Wiener index of hypergraphs (Q782127) (← links)
- Monotonicity of the mean order of subtrees (Q796552) (← links)
- Computing the average distance of an interval graph (Q1334633) (← links)
- On the sum of all distances in composite graphs (Q1343276) (← links)
- Independence and average distance in graphs (Q1363759) (← links)
- On the average Steiner distance of graphs with presribed properties (Q1372733) (← links)
- Average distance and domination number (Q1377614) (← links)
- Wiener number of vertex-weighted graphs and a chemical application (Q1377617) (← links)
- Wiener index versus maximum degree in trees (Q1613418) (← links)
- An upper bound on Wiener indices of maximal planar graphs (Q1732098) (← links)
- Digraphs with large maximum Wiener index (Q1733463) (← links)
- Average distance is submultiplicative and subadditive with respect to the strong product of graphs (Q1740151) (← links)
- Mean distance in a tree (Q1813712) (← links)
- On the average number of nodes in a subtree of a tree (Q1838491) (← links)
- On exact solution approaches for the longest induced path problem (Q1999389) (← links)
- Cut and pendant vertices and the number of connected induced subgraphs of a graph (Q2040982) (← links)
- On the average order of a dominating set of a forest (Q2092347) (← links)
- Sphere theorems with and without smoothing (Q2147371) (← links)
- The upper bounds on the Steiner \(k\)-Wiener index in terms of minimum and maximum degrees (Q2165277) (← links)
- The average order of dominating sets of a graph (Q2231709) (← links)
- The \(\rho\)-moments of vertex-weighted graphs (Q2242687) (← links)
- The Steiner \(k\)-Wiener index of graphs with given minimum degree (Q2274075) (← links)
- Cospectrality of graphs with respect to distance matrices (Q2279251) (← links)
- Counterexamples to the conjecture on orientations of graphs with minimum Wiener index (Q2410240) (← links)
- Distance and eccentric sequences to bound the Wiener index, Hosoya polynomial and the average eccentricity in the strong products of graphs (Q2420415) (← links)
- Connections between Wiener index and matchings (Q2503738) (← links)
- A survey of the all-pairs shortest paths problem and its variants in graphs (Q2629565) (← links)
- Wiener indices of maximal \(k\)-degenerate graphs (Q2657107) (← links)
- On the<i>k</i>-ary hypercube tree and its average distance (Q3101622) (← links)
- On the average distance of the hypercube tree (Q3568450) (← links)
- Average distance and vertex-connectivity (Q3652548) (← links)
- Average distance, minimum degree, and spanning trees (Q4944680) (← links)
- Wiener Index and Remoteness in Triangulations and Quadrangulations (Q4987269) (← links)
- Proximity in triangulations and quadrangulations (Q5054040) (← links)
- Wiener index of graphs with fixed number of pendant or cut-vertices (Q5084252) (← links)
- On the transmission-based graph topological indices (Q5159710) (← links)
- On a conjecture about the ratio of Wiener index in iterated line graphs (Q5198014) (← links)
- Average Distance, Independence Number, and Spanning Trees (Q5495880) (← links)
- Hosoya polynomials and Wiener indices of carbon nanotubes using mathematica programming (Q5865668) (← links)
- On maximum Wiener index of directed grids (Q5888418) (← links)
- Continuous mean distance of a weighted graph (Q6045116) (← links)
- Average distance, minimum degree, and irregularity index (Q6080130) (← links)
- (Q6101493) (← links)
- Mean distance on metric graphs (Q6200350) (← links)
