Results 231 to 238 of about 5,633 (238)

On Distance-Preserving and Domination Elimination Orderings

SIAM Journal on Discrete Mathematics, 1998
Let \(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

2016
Distance 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, 2020
R. Veerasivaji, S. Meenakshi
openaire   +1 more source

Distance Dominating on Tree

Journal of Xidian University, 2020
openaire   +1 more source

Colorings, Distance, and Domination

2008
openaire   +2 more sources

Kenyan Dominance in Distance Running

Medicine & Science in Sports & Exercise, 2005
openaire   +1 more source

l Distance Domination in Semigraph

C. R. Krishnapriya, V. Seena
openaire   +1 more source

Distance domination in partitioned graphs

2006
Fu, Chin-Mei Kau, Vestergaard, Preben D.
openaire   +1 more source