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
Distance Measurements Related to Cartesian Product of Cycles
TL;DR: This manuscript has discussed distance measurements including center, periphery, and average eccentricity for the Cartesian product of two cycles, and all possible cases have been proved.
Proceedings ArticleDOI
Cycle embedding in faulty hierarchical cubic networks
Jung-Sheng Fu,Gen-Huey Chen +1 more
TL;DR: Using Gray codes, fault-free hamiltonian cycles in an HCN(n) with n-1 link faults are constructed, and since the HCN (n) is regular of degree
Journal ArticleDOI
Edge Jump Distance Graphs
TL;DR: The concept of edge jump between graphs and distance between graphs was introduced by Gary Chartrand et al. as discussed by the authors, where a graph H is obtained from a graph G by an edge jump if G contains four distinct vertices u, v, w, and x such that uv belongs to ǫ(G), wx does not belong to E(G) and H isomorphic to G + wx.
Journal Article
Monophonic wirelength of circulant networks into wheels and fans
K.U. Samundesvari,G.S. Michael +1 more
TL;DR: A monophonic algorithm is presented to find themonophonic wirelength of family of circulant graphs into wheels and fans and produce the monophile wirelength and cover a wide range of interconnection networks.
Journal ArticleDOI
A note on the Steiner -diameter of a graph
TL;DR: In this paper, graphs with for are characterized and the Steiner distance among the vertices of S is the minimum size among all connected subgraphs whose vertex sets contain S.