1. A census of 4-valent half-arc-transitive graphs and arc-transitive digraphs of valence two : dedicated to Dragan Marušič on the occasion of his 60th birthdayPrimož Potočnik, Pablo Spiga, Gabriel Verret, 2015, izvirni znanstveni članek Opis: A complete list of all connected arc-transitive asymmetric digraphs of in-valence and out-valence 2 on up to 1000 vertices is presented. As a byproduct, a complete list of all connected 4-valent graphs admitting a half-arc-transitive group of automorphisms on up to 1000 vertices is obtained. Several graph-theoretical properties of the elements of our census are calculated and discussed.
Ključne besede: graphs, digraphs, edge-transitive, vertex-transitive, arc-transitive, half arc-transitive
Objavljeno v RUP: 30.12.2021; Ogledov: 1187; Prenosov: 17
 Celotno besedilo (370,47 KB) |
2. |
3. |
4. |
5. |
6. Set graphs. II. Complexity of set graph recognition and similar problemsMartin Milanič, Romeo Rizzi, Alexandru I. Tomescu, 2014, izvirni znanstveni članek Ključne besede: acyclic orientation, extensionality, set graphs, NP-complete problem, #P-complete problem, hyper-extensional digraphs, separating code, open-out-separating code
Objavljeno v RUP: 02.04.2017; Ogledov: 2568; Prenosov: 133
 Povezava na celotno besedilo |
7. A note on a conjecture on consistent cyclesŠtefko Miklavič, 2013, izvirni znanstveni članek Opis: Let ▫$\Gamma$▫ denote a finite digraph and let ▫$G$▫ be a subgroup of its automorphism group. A directed cycle ▫$\vec{C}$▫ of▫ $\Gamma$▫ is called ▫$G$▫-consistent whenever there is an element of ▫$G$▫ whose restriction to▫ $\vec{C}$▫ is the 1-step rotation of ▫$\vec{C}$▫. In this short note we provea conjecture on ▫$G$▫-consistent directed cycles stated by Steve Wilson.
Ključne besede: graph theory, digraphs, consistent directed cycles
Objavljeno v RUP: 15.10.2013; Ogledov: 2875; Prenosov: 129
Celotno besedilo (229,03 KB) |
8. |
