Results 141 to 150 of about 4,954 (163)

Highly arc-transitive digraphs — Structure and counterexamples

Combinatorica, 2014
Unlike the case of connected finite digraphs, where outside the oriented cycles the \(s\)-arc-transitivity is limited to \( s \leq 8 \), families of infinite digraphs which are \(s\)-arc-transitive for all \( s \geq 0 \) exist in abundance. Nevertheless, constructions of such families are often quite involved; with the proof of the \(s\)-arc ...
DeVos, Matt, Mohar, Bojan, Samal, Robert
openaire   +1 more source

Highly arc transitive digraphs

2010
Unendliche, hochgradig bogentransitive Digraphen werden definiert und anhand von Beispielen vorgestellt. Die Erreichbarkeitsrelation und Eigenschaft–Z werden definiert und unter Verwendung von Knotengraden, Wachstum und anderen Eigenschaften, die von der Untersuchung von Nachkommen von Doppelstrahlen oder Automorphismengruppen herrühren, auf hochgradig
openaire   +1 more source

On arc-transitive circulant digraphs

Applied Mathematics-A Journal of Chinese Universities, 1997
Let \(Z_n\) be the cyclic group of order \(n\). For \(S\subseteq Z_n \setminus \{0\}\), a circulant digraph \(C_n(S)\) is a directed simple graph with vertex set \(Z_n\) and arc set \(\{(u,v) \mid v-u\in S\}\). The following results are presented: Theorem 1. Let \(S= \{a,b\}\) generate \(Z_n\).
openaire   +2 more sources

Classification of vertex-transitive \(pq\)-digraphs

1994
We give a classification of vertex-transitive digraphs whose order is a product of two primes. As it is known that each vertex-transitive \(p^2\)-digraph is a Cayley digraph of one of the two nonisomorphic groups of order \(p^2\) [the first author, Ann. Discrete Math.
MARUSIC D., SCAPELLATO, RAFFAELE
openaire   +2 more sources

Ranked Highly-Arc-Transitive Digraphs as Colimits

Order, 2013
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Vertex-transitive graphs and digraphs

1997
The aim of the present paper is to illustrate concepts and methods employed while working in the area of vertex-transitive graphs (or VT-graphs for short), through recently obtained significant results.
openaire   +2 more sources

Transitivity in stochastic graphs and digraphs

The Journal of Mathematical Sociology, 1980
Transitivity is a central concept for many relational structures, e.g. clusterings and partial orderings. Stochastic graph models which are used to describe uncertain relational structures can be tested for transitivity by using indices based on triad counts.
openaire   +1 more source

Quasi-Transitive Digraphs and Their Extensions

2018
A digraph D is quasi-transitive if for any three distinct vertices x, y, z in D, the existence of the arcs xy and yz in D implies that xz, zx or both are arcs of D. Quasi-transitive digraphs generalize both tournaments (and semicomplete digraphs) and transitive digraphs, and share some of the nice properties of these families.
Hortensia Galeana-Sánchez, César Hernández-Cruz   +1 more
openaire   +1 more source

The smallest vertex-primitive 2-arc-transitive digraph

Journal of Algebra, 2023
Fu-Gang Yin, Binzhou Xia, Yan-Quan Feng
exaly  

k ‐quasi‐transitive digraphs of large diameter

Journal of Graph Theory, 2021
César Hernández-Cruz
exaly