Results 251 to 258 of about 263,414 (258)
Some of the next articles are maybe not open access.
Distance-Hereditary Graphs, Steiner Trees, and Connected Domination
SIAM Journal on Computing, 1988Summary: Distance-hereditary graphs have been introduced by Howorka and studied in the literature with respect to their metric properties. In this paper several equivalent characterizations of these graphs are given: in terms of existence of particular kinds of vertices (isolated, leaves, twins) and in terms of properties of connections, separators ...
A. D'Atri, MOSCARINI, Marina
openaire +4 more sources
On Distance-Preserving and Domination Elimination Orderings
SIAM Journal on Discrete Mathematics, 1998Let \(G= (V,E)\) be a finite undirected graph. The distance between two vertices in \(G\) is the length of a shortest path between them. An induced subgraph \(G(U)\) of \(G\) for \(U\subseteq V\) is isometric if the distances in \(G(U)\) are the same as in \(G\).
openaire +2 more sources
Diagonally Dominant Programming in Distance Geometry
2016Distance geometry is a branch of geometry which puts the concept of distance at its core. The fundamental problem of distance geometry asks to find a realization of a finite, but partially specified, metric space in a Euclidean space of given dimension. An associated problem asks the same question in a Euclidean space of any dimension.
Gustavo Dias, Leo Liberti
openaire +1 more source
PERFECT DISTANCE DOMINATING SET
Advances in Mathematics: Scientific Journal, 2020R. Veerasivaji, S. Meenakshi
openaire +1 more source
Kenyan Dominance in Distance Running
Medicine & Science in Sports & Exercise, 2005openaire +1 more source