Results 81 to 90 of about 4,954 (163)

A class of vertex-transitive digraphs

open access: yesJournal of Combinatorial Theory, Series B, 1973
Abstract1.1. We determine all the symmetric digraphs with a prime number, p, of vertices. We also determine the structure of their groups. Our results are similar to the case of undirected graphs. But some of the proofs are simpler.2.2. The isomorphic classes of the vertex-transitive digraphs with p vertices are enumerated.3.3.
Chao, Chong-Yun, Wells, Jacqueline G
openaire   +1 more source

An application of neighbourhoods in digraphs to the classification of binary dynamics. [PDF]

open access: yesNetw Neurosci, 2022
Conceição P   +5 more
europepmc   +1 more source

Digraphs Admitting Sharply Edge-transitive Automorphism Groups

open access: yesEuropean Journal of Combinatorics, 1987
A permutation group G on a set X is a sharply edge-transitive group (SETG) if there exists a directed graph (X,R) such that \(G\leq Aut(X,R)\) and G acts as a regular permutation group on R. Let \(K^ h_ m\) denote the directed graph whose vertex set is partitioned into h disjoint m-sets and any two vertices in distinct m-sets are joined in both ...
openaire   +2 more sources

Critical Kernel Imperfectness in 4-quasi-transitive digraphs and 4-anti-transitive digraphs of small diameter

open access: yesDiscrete Applied Mathematics
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Germán Benítez-Bobadilla   +2 more
openaire   +1 more source

Home - About - Disclaimer - Privacy