Results 71 to 80 of about 795,931 (124)

$16$-vertex graphs with automorphism groups $A_{4}$ and $A_{5}$ from icosahedron [PDF]

open access: yesarXiv, 2019
The article deals with the problem of finding vertex-minimal graphs with a given automorphism group. We exhibit two undirected $16$-vertex graphs having automorphism groups $A_{4}$ and $A_{5}$. It improves the Babai's bound for $A_{4}$ and the graphical regular representation bound for $A_{5}$.
arxiv  

A Parameterized Algorithm for Vertex and Edge Connectivity of Embedded Graphs [PDF]

open access: yesarXiv
The problem of computing vertex and edge connectivity of a graph are classical problems in algorithmic graph theory. The focus of this paper is on computing these parameters on embedded graphs. A typical example of an embedded graph is a planar graph which can be drawn with no edge crossings.
arxiv  

On number of ends of graph products of groups [PDF]

open access: yesarXiv, 2019
Given a finite simplicial graph $\Gamma=(V,E)$ with a vertex-labelling $\varphi:V\rightarrow\left\{\text{non-trivial finitely generated groups}\right\}$, the graph product $G_\Gamma$ is the free product of the vertex groups $\varphi(v)$ with added relations that imply elements of adjacent vertex groups commute. For a quasi-isometric invariant $\mathcal{
arxiv  

The complexity of the vertex-minor problem [PDF]

open access: yesarXiv, 2019
A graph H is a vertex-minor of a graph G if it can be reached from G by the successive application of local complementations and vertex deletions. Vertex-minors have been the subject of intense study in graph theory over the last decades and have found applications in other fields such as quantum information theory.
arxiv  

Single-cell 3D genome reconstruction in the haploid setting using rigidity theory. [PDF]

open access: yesJ Math Biol
Dewar S   +4 more
europepmc   +1 more source

Home - About - Disclaimer - Privacy