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
The Minimum Eccentric Dominating Graph
M. Bhanumathi,J. John Flavia +1 more
TL;DR: The minimum eccentric dominating graph MmD E (G) of a graph G is defined to be the intersection graph on the minimum eccentric dominate sets of G, and some families of graphs are studied.
Journal ArticleDOI
Ordering trees having small reverse wiener indices
Rundan Xing,Bo Zhou +1 more
TL;DR: In this article, the reverse Wiener index of a connected graph G is defined as the sum of distances between all unordered pairs of vertices of G. As a variation of the Wiener Index, the reverse W(G) of G was defined as Λ (G) = 1 n n(n − 1)d − W (G), where n is the number of nodes, d is the diameter of G, and W is the distance between nodes.
Journal ArticleDOI
Wiener index of uniform hypergraphs induced by trees
TL;DR: In this article, the authors define the Wiener index W(G) of a graph G as the sum of distances between its vertices, and establish a relation between quantities W(T) and W(Hr,k(T)) is established.
Journal ArticleDOI
The n-Hosoya Polynomials of Some Classes of Thorn Graphs
Ali A. Ali,Ahmed Ali +1 more
TL;DR: The n-Hosoya Polynomials of cog-complete graphs, thorn cog- complete graphs, cog stars, cog-stars, cog-wheels, and thorn cog wheels are obtained in this article.