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
Distance measures in graphs and subgraphs.
TL;DR: In this article, the authors investigate how the modification of a graph affects various distance measures and find the maximum possible change in the parameter due to such modifications, in addition, they consider the cases where the removed vertex or edge is one for which the parameter is minimised after deletion.
Book ChapterDOI
Voronoi Diagram Distances
Michel Deza,Elena Deza +1 more
TL;DR: Given a finite set A of objects A i in a space S, computing the Vor onoi diagram of A means partitioning the space S into Voronoi regions V (A i ) in such a way that V ( a i ) contains all points of S that are “closer” to A i than to any other object A j in A.
Journal ArticleDOI
The structural and behavioral characteristics of the smallest-world phenomenon: minimum distance networks
TL;DR: A rational choice theory of ego-centric network ties is introduced to evaluate the relevance of minimum distance networks for the small-world phenomenon and Nash equilibria derived from utility models of ego theorems for rational actors are described.
Journal ArticleDOI
Inverse Domination Numbers and Disjoint Domination Numbers of Graphs under Some Binary Operations
TL;DR: In this paper, the inverse domination numbers and disjoint pair domination numbers of graphs resulting from the join, corona and composition of graphs are investigated, and the authors investigate inverse domination number and pair domination number of graphs.
Journal ArticleDOI
On Eccentric Digraphs of Graphs
TL;DR: In this article, the authors considered an open problem of characterizing graphs with specified maximum degree such that ED(G) = G. In this paper, they have considered the problem of determining the eccentricity e(u) of a vertex u to any other vertex of a graph.