AbstractIn this paper the following two problems are solved: Given any point-symmetric graph or digraph Γ of prime order the automorphism group of Γ is explicitly determined and given any transitive permutation group G of prime degree p the number of digraphs and graphs of order p having G as their automorphism group is determined
An automorphism of finite graph G is a permutation on its vertex set that conserves adjacency. The s...
AbstractThe circulant digraph Γ is considered when the number n of vertices of Γ is equal to pm for ...
AbstractThis paper presents some results linking the minimal polynomial of the adjacency matrix of a...
AbstractIn this paper the following two problems are solved: Given any point-symmetric graph or digr...
AbstractThis paper discusses point-symmetric graphs which have a prime number of points. Isomorphism...
Many properties of graphs and their behavior can be studied much easier with Group Theory applicatio...
AbstractLet Γ be a simple undirected graph and G a subgroup of Aut Γ. Γ is said to be G-symmetric, i...
AbstractIt is proved that if p is a prime, k and m⩽p are positive integers, and I is a vertex symmet...
Abstract1.1. We determine all the symmetric digraphs with a prime number, p, of vertices. We also de...
AbstractA simple undirected graph Γ is said to be symmetric if its automorphism group Aut Γ is trans...
Abstract. A graph is symmetric, if its automorphism group is transitive on the set of its arcs. In t...
The study of groups from geometric viewpoint has recently become one of the focus of researches in g...
It has been conjectured that automorphism groups of vertex-transitive (di)graphs, and more generally...
Groups of automorphisms of graphs - abstract In this thesis we investigate automorphism groups of se...
This paper presents some results linking the minimal polynomila of the adjacency matrix of a graph w...
An automorphism of finite graph G is a permutation on its vertex set that conserves adjacency. The s...
AbstractThe circulant digraph Γ is considered when the number n of vertices of Γ is equal to pm for ...
AbstractThis paper presents some results linking the minimal polynomial of the adjacency matrix of a...
AbstractIn this paper the following two problems are solved: Given any point-symmetric graph or digr...
AbstractThis paper discusses point-symmetric graphs which have a prime number of points. Isomorphism...
Many properties of graphs and their behavior can be studied much easier with Group Theory applicatio...
AbstractLet Γ be a simple undirected graph and G a subgroup of Aut Γ. Γ is said to be G-symmetric, i...
AbstractIt is proved that if p is a prime, k and m⩽p are positive integers, and I is a vertex symmet...
Abstract1.1. We determine all the symmetric digraphs with a prime number, p, of vertices. We also de...
AbstractA simple undirected graph Γ is said to be symmetric if its automorphism group Aut Γ is trans...
Abstract. A graph is symmetric, if its automorphism group is transitive on the set of its arcs. In t...
The study of groups from geometric viewpoint has recently become one of the focus of researches in g...
It has been conjectured that automorphism groups of vertex-transitive (di)graphs, and more generally...
Groups of automorphisms of graphs - abstract In this thesis we investigate automorphism groups of se...
This paper presents some results linking the minimal polynomila of the adjacency matrix of a graph w...
An automorphism of finite graph G is a permutation on its vertex set that conserves adjacency. The s...
AbstractThe circulant digraph Γ is considered when the number n of vertices of Γ is equal to pm for ...
AbstractThis paper presents some results linking the minimal polynomial of the adjacency matrix of a...
DOI
Add to ORKG