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, original scientific article Abstract: 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. Keywords: graphs, digraphs, edge-transitive, vertex-transitive, arc-transitive, half arc-transitive Published in RUP: 31.12.2021; Views: 799; Downloads: 16 Full text (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, original scientific article Keywords: acyclic orientation, extensionality, set graphs, NP-complete problem, #P-complete problem, hyper-extensional digraphs, separating code, open-out-separating code Published in RUP: 03.04.2017; Views: 2223; Downloads: 131 Link to full text |
7. A note on a conjecture on consistent cyclesŠtefko Miklavič, 2013, original scientific article Abstract: 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. Keywords: graph theory, digraphs, consistent directed cycles Published in RUP: 15.10.2013; Views: 2542; Downloads: 123 Full text (229,03 KB) |
8. |