Computing the average distance of an interval graph
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 4031733 (Why is no real title available?)
- scientific article; zbMATH DE number 4041962 (Why is no real title available?)
- scientific article; zbMATH DE number 4108815 (Why is no real title available?)
- A unified approach to domination problems on interval graphs
- An optimal algorithm to solve the all-pair shortest path problem on interval graphs
- Average distance and independence number
- Average distance in graphs with removed elements
- Average distances in undirected graphs and the removal of vertices
- Edge-vulnerability and mean distance
- Eigenvalues, diameter, and mean distance in graphs
- Mean distance in a graph
- Mean distance in a tree
- ON DISTANCES IN CHROMATIC GRAPHS
- On mean distance in certain classes of graphs
- On the sum of all distances in a graph or digraph
- The average distance and the independence number
Cited in
(13)- MAD trees and distance-hereditary graphs
- Average distance and domination number
- Hitting times, cover cost, and the Wiener index of a tree
- A survey of the all-pairs shortest paths problem and its variants in graphs
- On average distance in tournaments and Eulerian digraphs
- On Wiener index and average eccentricity of graphs of girth at least 6 and \((C_4, C_5)\)-free graphs
- scientific article; zbMATH DE number 841632 (Why is no real title available?)
- Average distance and connected domination
- Average distance in weighted graphs
- Average distance, minimum degree, and spanning trees
- A Wiener-type graph invariant for some bipartite graphs
- On the average distance of the hypercube tree
- A linear-time algorithm to compute a MAD tree of an interval graph
This page was built for publication: Computing the average distance of an interval graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1334633)
