Results 21 to 30 of about 1,592 (153)
Semiregular automorphisms of edge-transitive graphs [PDF]
Journal of Algebraic Combinatorics, 2014 The polycirculant conjecture asserts that every vertex-transitive digraph has a semiregular automorphism, that is, a nontrivial automorphism whose cycles all have the same length. In this paper we investigate the existence of semiregular automorphisms of edge-transitive graphs.
Michael Giudici +2 more
openalex +4 more sources
Edge-transitive bi-Cayley graphs [PDF]
Journal of Combinatorial Theory, Series B, 2020 A graph $\G$ admitting a group $H$ of automorphisms acting semi-regularly on the vertices with exactly two orbits is called a {\em bi-Cayley graph\/} over $H$. Such a graph $\G$ is called {\em normal\/} if $H$ is normal in the full automorphism group of $\G$, and {\em normal edge-transitive\/} if the normaliser of $H$ in the full automorphism group of $
Marston Conder +3 more
openaire +3 more sources
Classifying a family of edge-transitive metacirculant graphs [PDF]
Journal of Algebraic Combinatorics, 2011 A characterization is given of the class of edge-transitive Cayley graphs of Frobenius groups $\mathbb{Z}_{p^{d}}{:}\mathbb{Z}_{q}$ with p,q odd prime, of valency coprime to p. This characterization is then used to study an isomorphism problem regarding Cayley graphs, and to construct new families of half-arc-transitive graphs.
Shu Jiao Song, Cai Heng Li, Dianjun Wang
openalex +3 more sources
Weakly Norming Graphs are Edge-Transitive [PDF]
Combinatorica, 2020 to appear in "Combinatorica"
openaire +4 more sources
Edge-transitive token graphs as covers [PDF]
This paper uses the theory of covering graphs to characterize some of the edge-transitive graphs which can arise as token graphs.
Sergio Gerardo Gómez-Galicia +1 more
openalex +3 more sources
On Edge-Transitive Graphs of Square-Free Order
The Electronic Journal of Combinatorics, 2015 We study the class of edge-transitive graphs of square-free order and valency at most $k$. It is shown that, except for a few special families of graphs, only finitely many members in this class are basic (namely, not a normal multicover of another member).
Cai Heng Li, Zai Ping Lu, Gai Xia Wang
openalex +3 more sources
Triangles in the suborbital graphs of the normalizer of $\Gamma_0(N)$
Indonesian Journal of Combinatorics, 2020 In this paper, we investigate a suborbital graph for the normalizer of $\Gamma_0(N) in PSL(2;R)$, where N will be of the form 2^4p^2 such that p > 3 is a prime number.
Nazlı Yazıcı Gözütok +1 more
doaj +1 more source
One Edge at a Time: A Novel Approach Towards Efficient Transitive Reduction Computation on DAGs
IEEE Access, 2020 Given a directed acyclic graph (DAG) G, G's transitive reduction (TR) Gtr is the unique DAG satisfying that Gtr has the minimum number of edges and has the same transitive closure (TC) as G.
Xian Tang +5 more
doaj +1 more source
Arc-Disjoint Hamiltonian Paths in Strong Round Decomposable Local Tournaments
Discussiones Mathematicae Graph Theory, 2021 Thomassen, [Edge-disjoint Hamiltonian paths and cycles in tournaments, J. Combin. Theory Ser. B 28 (1980) 142–163] proved that every strong tournament has a pair of arc-disjoint Hamiltonian paths with distinct initial vertices and distinct terminal ...
Meng Wei
doaj +1 more source
Edge-Transitive Lexicographic and Cartesian Products
Discussiones Mathematicae Graph Theory, 2016 In this note connected, edge-transitive lexicographic and Cartesian products are characterized. For the lexicographic product G ◦ H of a connected graph G that is not complete by a graph H, we show that it is edge-transitive if and only if G is edge ...
Imrich Wilfried +3 more
doaj +1 more source