AbstractWe introduce the concept of quasi-Cayley graphs, a class of vertex-transitive graphs which contains Cayley graphs, and study some of their properties. By finding vertex-transitive graphs which are not quasi-Cayley graphs we give a negative answer to a question by Fuller and Krishnamurthy on the quasi-group representation of a vertex-transitive graph
Let G be a finite group, and S a subset of G with 1 is not an element of S and S-1 = S. If S is a un...
We examine the existing constructions of the smallest known vertex-transitive graphs of a given degr...
AbstractMarušič (Ann. Discrete Math. 27 (1985) 115) proved that all vertex-transitive graphs of orde...
AbstractWe introduce the concept of quasi-Cayley graphs, a class of vertex-transitive graphs which c...
The first part of this dissertation deals with highly symmetrical combinatorial structures - vertex ...
The isomorphism problem of Cayley graphs has been well studied in the literature, such as characteri...
AbstractIn this paper, we first give a characterization of Cayley graphs of rectangular groups. Then...
AbstractWe investigate Cayley graphs of semigroups and show that they sometimes enjoy properties ana...
The pursuit to identify vertex-transitive non-Cayley graphs has been deliberate for some time ...
In this paper we introduce a new class of double coset Cayley digraphs induced by quasigroups. These...
AbstractWe investigate Cayley graphs of strong semilattices of right (left) groups, of right (left) ...
Abstract. A. V. Kelarev and C. E. Praeger in [11] gave necessary and sufficient conditions for Cayle...
In this paper, first we characterize Cayley graphs of finite Brandt semigroups, and we give a criter...
>Magister Scientiae - MScThe pursuit of graphs which are vertex-transitive and non-Cayley on groups ...
An r-regular family F of permutations on a set V contains, for each pair of vertices u,v∈V, exactly ...
Let G be a finite group, and S a subset of G with 1 is not an element of S and S-1 = S. If S is a un...
We examine the existing constructions of the smallest known vertex-transitive graphs of a given degr...
AbstractMarušič (Ann. Discrete Math. 27 (1985) 115) proved that all vertex-transitive graphs of orde...
AbstractWe introduce the concept of quasi-Cayley graphs, a class of vertex-transitive graphs which c...
The first part of this dissertation deals with highly symmetrical combinatorial structures - vertex ...
The isomorphism problem of Cayley graphs has been well studied in the literature, such as characteri...
AbstractIn this paper, we first give a characterization of Cayley graphs of rectangular groups. Then...
AbstractWe investigate Cayley graphs of semigroups and show that they sometimes enjoy properties ana...
The pursuit to identify vertex-transitive non-Cayley graphs has been deliberate for some time ...
In this paper we introduce a new class of double coset Cayley digraphs induced by quasigroups. These...
AbstractWe investigate Cayley graphs of strong semilattices of right (left) groups, of right (left) ...
Abstract. A. V. Kelarev and C. E. Praeger in [11] gave necessary and sufficient conditions for Cayle...
In this paper, first we characterize Cayley graphs of finite Brandt semigroups, and we give a criter...
>Magister Scientiae - MScThe pursuit of graphs which are vertex-transitive and non-Cayley on groups ...
An r-regular family F of permutations on a set V contains, for each pair of vertices u,v∈V, exactly ...
Let G be a finite group, and S a subset of G with 1 is not an element of S and S-1 = S. If S is a un...
We examine the existing constructions of the smallest known vertex-transitive graphs of a given degr...
AbstractMarušič (Ann. Discrete Math. 27 (1985) 115) proved that all vertex-transitive graphs of orde...
DOI
Add to ORKG