Results 11 to 20 of about 246,733 (219)
Monophonic Distance in Graphs [PDF]
Discrete Mathematics, Algorithms and Applications, 2011 For any two vertices u and v in a connected graph G, a u – v path is a monophonic path if it contains no chords, and the monophonic distance dm(u, v) from u to v is defined as the length of a longest u – v monophonic path in G. A u – v monophonic path of length dm(u, v) is called a u – v monophonic. The monophonic eccentricity em(v) of a vertex v in G
A. P. Santhakumaran, P. Titus
openaire +2 more sources
Distance labeling in graphs [PDF]
Journal of Algorithms, 2004 Summary: We consider the problem of labeling the nodes of a graph in a way that will allow one to compute the distance between any two nodes directly from their labels (without using any additional information). Our main interest is in the minimal length of labels needed in different cases.
Gavoille, Cyril +3 more
openaire +4 more sources
Distance Domination and Distance Irredundance in Graphs [PDF]
The Electronic Journal of Combinatorics, 2007 A set $D\subseteq V$ of vertices is said to be a (connected) distance $k$-dominating set of $G$ if the distance between each vertex $u\in V-D$ and $D$ is at most $k$ (and $D$ induces a connected graph in $G$). The minimum cardinality of a (connected) distance $k$-dominating set in $G$ is the (connected) distance $k$-domination number of $G$, denoted ...
Adriana Hansberg +2 more
openaire +2 more sources
Exact Distance Graphs of Product Graphs [PDF]
Graphs and Combinatorics, 2019 Given a graph $G$, the exact distance-$p$ graph $G^{[\natural p]}$ has $V(G)$ as its vertex set, and two vertices are adjacent whenever the distance between them in $G$ equals $p$. We present formulas describing the structure of exact distance-$p$ graphs of the Cartesian, the strong, and the lexicographic product.
Brešar, Boštjan +3 more
openaire +4 more sources
On the graph of large distances [PDF]
Discrete & Computational Geometry, 1989 Let \(S\) be a set of \(n\) points in the plane and let \(d_1>d_2>..\). be the different distances determined by the set \(S\). The graph \(G(S,k)\) is considered whose vertex set is S and in which two vertices are adjacent if and only if their distance is at least \(k\). The chromatic number \(\chi(G(S,k))\) of \(G(S,k)\) is studied. It is proved that
Erdös, P. +2 more
openaire +1 more source
Distance-unbalancedness of graphs [PDF]
Applied Mathematics and Computation, 2021 14 pages, 3 ...
Miklavič, Štefko, Šparl, Primož
openaire +3 more sources
Distance measures for embedded graphs [PDF]
Computational Geometry, 2021 We introduce new distance measures for comparing straight-line embedded graphs based on the Fréchet distance and the weak Fréchet distance. These graph distances are defined using continuous mappings and thus take the combinatorial structure as well as the geometric embeddings of the graphs into account.
Hugo A. Akitaya +4 more
openaire +5 more sources
Distance in stratified graphs [PDF]
Czechoslovak Mathematical Journal, 2000 A stratified graph is an ordered pair \((G,S)\), where \(G\) is an undirected graph and \(S\) is a partition of its vertex set \(V(G)\) into classes called strata. For any stratum \(X\) the concepts analogous to the basic concepts concerning distance may be defined, namely \(X\)-eccentricity, \(X\)-radius, \(X\)-diameter, \(X\)-center, \(X\)-periphery.
Chartrand, Gary +3 more
openaire +1 more source
Discrete Mathematics, 1992 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources