Results 281 to 290 of about 114,426,441 (303)
Some of the next articles are maybe not open access.
Journal of Graph Theory, 2001
The orientation distance between two orientations \(D\) and \(D'\) of a graph \(G\) is the minimum number of edges of \(G\) whose orientation needs to be reversed to transform \(D\) into an orientation isomorphic to \(D'\). The orientation distance graph with respect to \(G\) is a graph whose vertex set is a certain set of such orientations and in ...
Gary Chartrand +3 more
openaire +3 more sources
The orientation distance between two orientations \(D\) and \(D'\) of a graph \(G\) is the minimum number of edges of \(G\) whose orientation needs to be reversed to transform \(D\) into an orientation isomorphic to \(D'\). The orientation distance graph with respect to \(G\) is a graph whose vertex set is a certain set of such orientations and in ...
Gary Chartrand +3 more
openaire +3 more sources
Stratified graphs and distance graphs
Ars Comb., 2000The author answers several questions of \textit{G. Chartrand} et al. [Congr. Numerantium 107, 81-96 (1995; Zbl 0896.05022)] concerning so called stratified graphs and distance graphs. A graph is stratified if its vertex set is partitioned into stable sets.
openaire +2 more sources
Graph Distance and Euclidean Distance on the Grid
1990Given a connected graph G = (V, E),V = Z2, on the lattice points of the plane, let d G (p, q) and d(p,q) denote the graph distance and the Euclidean distance between p and q respectively. In this note we prove that for every є > 0 there is a graph G = Gє and a constant d = dє such that $$\left| {{d}_{G}}(p,q)-d(p,q) \right|
Pach, János +2 more
openaire +2 more sources
Ars Comb., 1999
For a set \(D\) of positive integers, the distance graph \(G(D)\) has the integers as vertex set and two integers \(u,v\) are adjacent if \(|u-v|\in D\). The question of determining the chromatic number of distance graphs and first results can be found in \textit{R. B. Eggleton, P. Erdős}, and \textit{D. K. Skilton} [J. Comb. Theory, Ser. B 39, 86-100 (
openaire +2 more sources
For a set \(D\) of positive integers, the distance graph \(G(D)\) has the integers as vertex set and two integers \(u,v\) are adjacent if \(|u-v|\in D\). The question of determining the chromatic number of distance graphs and first results can be found in \textit{R. B. Eggleton, P. Erdős}, and \textit{D. K. Skilton} [J. Comb. Theory, Ser. B 39, 86-100 (
openaire +2 more sources
Distance Laplacian spectral ordering of sun type graphs
Applied Mathematics and Computation, 2023Hilal A Ganie +2 more
exaly
ON FINITE PRIME DISTANCE GRAPHS
Indian Journal of Pure and Applied Mathematics, 2021A Parthiban
exaly
Characterizing distance-regularity of graphs by the spectrum
Journal of Combinatorial Theory - Series A, 2006E Spence, E R van Dam, J H Koolen
exaly
Distance-hereditary graphs are clique-perfect
Discrete Applied Mathematics, 2006Maw-Shang Chang, Chuan-Min Lee
exaly
The distance spectrum and energy of the compositions of regular graphs
Applied Mathematics Letters, 2009Dragan Stevanovic
exaly