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
Dissertation
Representation, Graph Evolution, and the Induction of Desired Behaviours
TL;DR: Barlow et al. as mentioned in this paper examined the novel problem of graph evolution and developed many foundational aspects that, to date, have not been explored, such as representation, graph evolution, and graph evolution.
Complementary Distance Pattern Uniform Graphs
Beena Koshy,K A Germina +1 more
TL;DR: In this article, the Complementary Distance Pattern Uniform Set (CDPU set) is defined as the smallest cardinality of CDPU set in a graph G =(V,E )i sComplementary distance pattern uniform.
Book ChapterDOI
A vascular network growth estimation algorithm using random graphs
TL;DR: It is proposed that the relative frequencies of sprouting and splitting during the growth of a given renal glomerulus can be estimated by the invariants (root distance, radius, and diameter) of the graph representing the renalglomerulus network.
Posted Content
Cut vertex and unicyclic graphs with the maximum number of connected induced subgraphs
TL;DR: In this paper, the authors investigated the maximal unicyclic graphs with cut vertices and showed that there is a unique maximal unicycle graph with at most 3,4,5,5 vertices.
Journal ArticleDOI
q-Wiener index of some compound trees
TL;DR: In this article, formulas are obtained for computing the q-Wiener indices of some compound trees, and these generalize expressions, earlier known to hold for W. The q-analogs of W were conceived, motivated by the theory of hypergeometric series.