Results 271 to 280 of about 114,426,441 (303)
ON DISTANCE-$ I $-GRAPHS OF DISTANCE-REGULAR GRAPHS
ON DISTANCE-$ I $-GRAPHS OF DISTANCE-REGULAR GRAPHSopenaire +1 more source
Efficient stochastic epidemic simulation via the Sellke construction
Bootsma MC, van Boven M.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
2020
In this article, our ultimate goal is to transform a graph’s adjacency matrix into a distance matrix. Because cluster density is not observable prior to the actual clustering, our goal is to find a distance whose pairwise minimization will lead to densely connected clusters.
Pierre Miasnikof +4 more
openaire +1 more source
In this article, our ultimate goal is to transform a graph’s adjacency matrix into a distance matrix. Because cluster density is not observable prior to the actual clustering, our goal is to find a distance whose pairwise minimization will lead to densely connected clusters.
Pierre Miasnikof +4 more
openaire +1 more source
International Journal of Computational Geometry & Applications, 1991
A new necessary condition for a graph G to be the visibility graph of a simple polygon is given: each 3-connected component of G must have a vertex ordering in which every vertex is adjacent to a previous 3-clique. This property is used to give an algorithm for the distance visibility graph problem: given an edge-weighted graph G, is it the visibility
Collette R. Coullard, Anna Lubiw
openaire +2 more sources
A new necessary condition for a graph G to be the visibility graph of a simple polygon is given: each 3-connected component of G must have a vertex ordering in which every vertex is adjacent to a previous 3-clique. This property is used to give an algorithm for the distance visibility graph problem: given an edge-weighted graph G, is it the visibility
Collette R. Coullard, Anna Lubiw
openaire +2 more sources
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
Distance Graphs on the Integers
Combinatorics, Probability and Computing, 2005We consider several extremal problems concerning representations of graphs as distance graphs on the integers. Given a graph $G=(V,E)$, we wish to find an injective function $\phi:V\to{\mathbb Z}^+=\{1,2,\dots\}$ and a set ${\mathcal D}\subset{\mathbb Z}^+$ such that $\{u,v\}\in E$ if and only if $|\phi(u)-\phi(v)|\in{\mathcal D}$. Let $s(n)$ be the
Mike Ferrara +2 more
openaire +2 more sources
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
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 +2 more sources
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 +2 more sources
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
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 +2 more sources
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 +2 more sources