scispace - formally typeset
Open AccessBook

Distance in graphs

Fred Buckley, +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
Book ChapterDOI

Length Measures and Scales

Michel Deza, +1 more
TL;DR: The term length has many meanings: distance, extent, linear measure, span, reach, end, limit etc; for example, the length of a train, a meeting, a book, a trip, a shirt, a vowel, a proof as mentioned in this paper.
Journal ArticleDOI

Upper Detour Monophonic Number of a Graph

P. Titus, +1 more
- 01 Sep 2016 - 
TL;DR: Borders are determined and the upper detour monophonic number of certain classes of graphs are found and it is shown that for any three positive integers a, b, c with 2 ≤ a ≤ b ≤ c , there is a connected graph G with m ( G) = a, d m (G ) = b and d m + ( G ) = c.
Journal ArticleDOI

Connected Weak Edge Detour Number of a Graph

J M Prabakar, +1 more
- 01 Jun 2017 - 
TL;DR: In this article, it was shown that for each pair of integers k and n with 2 = D and R < D <= 2R, there exists a connected graph G with radD (G) = R, diamD G = D, and cdnw(G)=k.
Journal ArticleDOI

Certain topological indices and their polynomials of some cutting number nanostar Dendrimer $NS[n]$

P. Gladyis, +1 more
TL;DR: In this paper, the theoretical results about nanostar Dendrimer by topological indices are explained in a research paper, where the authors have discussed with 1st 2nd and 3rd cutting number Zagreb Index, Multiplicative and polynomial and also reverse hyper-Zagreb cutting number index multiplicative and polylogarithmic of Dendromer.
Journal ArticleDOI

The n-Wiener Polynomials of Straight Hexagonal Chains and Kt×Cr

Ali A. Ali, +1 more
- 01 Sep 2009 - 
TL;DR: The n-Wiener polynomials of straight hexagonal chains and the Cartesian product of a complete graph Kr and a cycle Cr were obtained in this article, where the n-diameter and the nWiener index of each such graph were also determined.