Results 1 to 10 of about 246,733 (219)
Some of the next articles are maybe not open access.
Graphs and Combinatorics, 2012
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Halperin, Alexander +2 more
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Halperin, Alexander +2 more
openaire +2 more sources
SIAM Journal on Scientific Computing, 2011
Measuring the connection strength between a pair of vertices in a graph is one of the most important concerns in many graph applications. Simple measures such as edge weights may not be sufficient for capturing the effects associated with short paths of lengths greater than one. In this paper, we consider an iterative process that smooths an associated
Jie Chen 0007, Ilya Safro
openaire +1 more source
Measuring the connection strength between a pair of vertices in a graph is one of the most important concerns in many graph applications. Simple measures such as edge weights may not be sufficient for capturing the effects associated with short paths of lengths greater than one. In this paper, we consider an iterative process that smooths an associated
Jie Chen 0007, Ilya Safro
openaire +1 more source
DISTANCES IN GRAPHS OF PERMUTATIONS
Rocky Mountain Journal of MathematicszbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dougherty, Steven T., Gianello, Mia
openaire +2 more sources
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 +2 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 +2 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 +1 more source
Bulletin of the London Mathematical Society, 1985
A result is proved which, together with a result of \textit{A. A. Ivanov} [Sov. Math., Dokl. 28, 149-152 (1983); translation from Dokl. Akad. Nauk SSSR 271, 789-792 (Russian) (1983; Zbl 0552.05034)], implies the theorem of Cameron (previously proved only using the classification of finite simple groups) that there are only finitely many finite distance-
openaire +1 more source
A result is proved which, together with a result of \textit{A. A. Ivanov} [Sov. Math., Dokl. 28, 149-152 (1983); translation from Dokl. Akad. Nauk SSSR 271, 789-792 (Russian) (1983; Zbl 0552.05034)], implies the theorem of Cameron (previously proved only using the classification of finite simple groups) that there are only finitely many finite distance-
openaire +1 more source
Ars Comb., 1997
Let \(G\) and \(H\) be two graphs with the same vertex set. It is said that \(G\) can be transformed into \(H\) by a switching operation, if \(G\) contains a subset \(U\) of vertices which either induces a complete graph such that \(H\) is obtained from \(G\) by deleting all edges of this graph, or induces a graph without edges such that \(H\) is ...
John G. Gimbel +2 more
openaire +1 more source
Let \(G\) and \(H\) be two graphs with the same vertex set. It is said that \(G\) can be transformed into \(H\) by a switching operation, if \(G\) contains a subset \(U\) of vertices which either induces a complete graph such that \(H\) is obtained from \(G\) by deleting all edges of this graph, or induces a graph without edges such that \(H\) is ...
John G. Gimbel +2 more
openaire +1 more source
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 +1 more source
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 +1 more source
Learning graph edit distance by graph neural networks
Pattern Recognition, 2021Pau Riba +2 more
exaly
The line graph of the crown graph is distance integral
Linear and Multilinear Algebra, 2023S Morteza Mirafzal
exaly