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
Diametral Paths In Total Graphs Of Complete Graphs, Complete Bipartite Graphs And Wheels
TL;DR: In this paper, the diametral path of a graph is defined as the shortest path between two vertices which has length equal to diameter of the graph, and it is determined in complete graphs, complete bipartite graphs, wheels and their total graphs.
Journal ArticleDOI
Optimal total exchange in Cayley graphs
TL;DR: This work presents a time-optimal solution for any Cayley network based on a class of algorithms which it calls node-invariant algorithms and which behave uniformly across the network.
Journal ArticleDOI
The explicit relation among the edge versions of detour index
TL;DR: In this paper, the explicit relations among edge versions of detour index have been declared and due to these relations, they compute the edge detour indices for some well-known graphs.
Journal ArticleDOI
The connected forcing connected vertex detour number of a graph
A. P. Santhakumaran,P. Titus +1 more
TL;DR: The minimum cardinality of a connected x-detour set of G is the connected x/y detour number of G and is denoted by cdx(G).
Book ChapterDOI
Tota; Exchange in Cayley Networks
TL;DR: This work presents a time-optimal solution to the total exchange problem, under the single-port assumption, for any Cayley graph and exploits symmetries inherent in Cayley graphs to devise what they call node-invariant algorithms which behave uniformly across the network.