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
Journal ArticleDOI
Eccentric connectivity index of graphs with subdivided edges
TL;DR: This work considers four classes of graphs arising from a given graph via different types of edge subdivisions and presents explicit formulas expressing their eccentric connectivity index in terms of the eccentric connectivityIndex of the original graph and some auxiliary invariants.
Journal Article
On the graphs with maximum distance or $k$-diameter
TL;DR: In this paper, the authors define the k-diameter of a graph as the maximum distance of a set of k vertices; so the 2diameter is the normal diameter and the ndiameter where n is the order is the distance of the graph.
Journal ArticleDOI
Bounds on the Distance Energy and the Distance Estrada Index of Strongly Quotient Graphs
TL;DR: The results improve most of the results obtained by Gungor and Bozkurt (2009) and Zaferani (2008), and some bounds for the distance energy and the distance Estrada index of CSQG whose diameter does not exceed two are presented.
Proceedings ArticleDOI
Some complexity aspects of the control of mobile robots
TL;DR: This paper explains why landmark-based navigation through a series of intermediary goals can be beneficial from a complexity point of view and shows how to choose the resolution of the sensors in order to generate control procedures with short description lengths.
Journal ArticleDOI
A generalized broadcasting schema for the mesh structures
TL;DR: This paper proposes a family of general broadcasting schemas for the 2d mesh structures that guarantee minimum delivery time at both the node and the structure level, and studies the close connection between this family of schemas and the class of effective routing paths.