Open AccessBook
Distance in graphs
Fred Buckley,Frank Harary +1 more
About:
The article was published on 1990-01-01 and is currently open access. It has received 1185 citations till now. The article focuses on the topics: Graph theory & Convexity.read more
Citations
More filters
Uphill & Downhill Domination in Graphs and Related Graph Parameters.
TL;DR: Deering et al. as discussed by the authors investigated graphical parameters related to downhill and uphill paths in graphs and gave a polynomial time algorithm to find a minimum downhill dominating set and a minimum uphill dominating set for any graph.
Journal ArticleDOI
Expected cover times of random walks on symmetric graphs
TL;DR: In this article, the authors give simple proofs for (N−1)HN −1 lower bound and an N 2 upper bound for the expected cover time of symmetric graphs.
Journal ArticleDOI
Three-center Harary index and its applications
TL;DR: In this paper, a generalization of the Harary index, denoted by Hk, is achieved by employing the Steiner-type distance between k-tuples of atoms, which is significantly better correlated with a variety of physico-chemical properties of alkanes than H itself.
Book ChapterDOI
Web marshals fighting curly link farms
Fabrizio Luccio,Linda Pagli +1 more
TL;DR: Upper and lower bounds on the number of marshals, and of link hops, needed to dismantle the farm are proved, which are both synchronous and asynchronous operations.
Journal ArticleDOI
Radius-edge-invariant and diameter-edge-invariant graphs
TL;DR: The eccentricity e(v) of v is the distance to a farthest vertex from v and the radius r(G) is the minimum eccentricity among the vertices of G and the diameter d(G), which is the maximum eccentricity of v.