AbstractGiven three integers k, ν and ϵ, we prove that there exists a finite k-regular graph whose automorphism group has exactly ν orbits on the set of vertices and ϵ orbits on the set of edges if and only if {(ν,ϵ)=(1,0)when k=0(ν,ϵ)=(1,1)when k=1ν=ϵ≥1when k=21≤ν≤2ϵ≤2kνwhen k≥3.Given an arbitrary odd prime p, we construct countably many pairwise non-isomorphic p-regular graphs which are edge-transitive but not vertex-transitive
Etant donné trois entiers k, s et a, nous prouvons dans le premier chapitre qu'il existe un graphe k...
A 2-cell embedding of a graph on a nonorientable closed surface is called regular if its automorphis...
A graph is 1-regular if its automorphism group acts regularly on the set of its arcs. Miller [J Comb...
AbstractGiven two integers ν > 0 and ϵ >/ 0, we prove that there exists a finite graph (resp. a fini...
Given two integers ν > 0 and ε{lunate} >/ 0, we prove that there exists a finite graph (resp. a fini...
AbstractGiven two integers π > 0 and β ⩾ 0, we prove that there exists a finite k-uniform hypergraph...
We prove that, given an infinite group G there is a directed graph X such that its automorphism grou...
AbstractGiven two integers ν > 0 and ϵ >/ 0, we prove that there exists a finite graph (resp. a fini...
t1 t2 t3 t4 t5 t6 t7 t8 t9 t10 11 lit Amply regular graph We consider undirected graphs without loop...
AbstractA new method for the construction of graphs with given regular group is developed and used t...
A graph X is said to represent the group G with k edge (vertex) orbits if the automorphism group of ...
AbstractA new method for the construction of graphs with given regular group is developed and used t...
AbstractA graph is 1- regular if its automorphism group acts regularly on the set of its arcs. Mille...
We prove that, given an infinite group G there is a directed graph X such that its automorphism grou...
Etant donné trois entiers k, s et a, nous prouvons dans le premier chapitre qu'il existe un graphe k...
Etant donné trois entiers k, s et a, nous prouvons dans le premier chapitre qu'il existe un graphe k...
A 2-cell embedding of a graph on a nonorientable closed surface is called regular if its automorphis...
A graph is 1-regular if its automorphism group acts regularly on the set of its arcs. Miller [J Comb...
AbstractGiven two integers ν > 0 and ϵ >/ 0, we prove that there exists a finite graph (resp. a fini...
Given two integers ν > 0 and ε{lunate} >/ 0, we prove that there exists a finite graph (resp. a fini...
AbstractGiven two integers π > 0 and β ⩾ 0, we prove that there exists a finite k-uniform hypergraph...
We prove that, given an infinite group G there is a directed graph X such that its automorphism grou...
AbstractGiven two integers ν > 0 and ϵ >/ 0, we prove that there exists a finite graph (resp. a fini...
t1 t2 t3 t4 t5 t6 t7 t8 t9 t10 11 lit Amply regular graph We consider undirected graphs without loop...
AbstractA new method for the construction of graphs with given regular group is developed and used t...
A graph X is said to represent the group G with k edge (vertex) orbits if the automorphism group of ...
AbstractA new method for the construction of graphs with given regular group is developed and used t...
AbstractA graph is 1- regular if its automorphism group acts regularly on the set of its arcs. Mille...
We prove that, given an infinite group G there is a directed graph X such that its automorphism grou...
Etant donné trois entiers k, s et a, nous prouvons dans le premier chapitre qu'il existe un graphe k...
Etant donné trois entiers k, s et a, nous prouvons dans le premier chapitre qu'il existe un graphe k...
A 2-cell embedding of a graph on a nonorientable closed surface is called regular if its automorphis...
A graph is 1-regular if its automorphism group acts regularly on the set of its arcs. Miller [J Comb...