44 research outputs found

    Quasi m-Cayley circulants

    Get PDF
    A graph â–«GammaGammaâ–« is called a quasi â–«mmâ–«-Cayley graph on a group â–«GGâ–« if there exists a vertex â–«inftyinV(Gamma)infty in V(Gamma)â–« and a subgroup â–«GGâ–« of the vertex stabilizer â–«textAut(Gamma)inftytext{Aut}(Gamma)_inftyâ–« of the vertex â–«inftyinftyâ–« in the full automorphism group â–«textAut(Gamma)text{Aut}(Gamma)â–« of â–«GammaGammaâ–«, such that â–«GGâ–« acts semiregularly on â–«V(Gamma)setminusinftyV(Gamma) setminus {infty}â–« with â–«mmâ–« orbits. If the vertex â–«inftyinftyâ–« is adjacent to only one orbit of â–«GGâ–« on â–«V(Gamma)setminusinftyV(Gamma) setminus {infty}â–«, then â–«GammaGammaâ–« is called a strongly quasi â–«mmâ–«-Cayley graph on â–«GGâ–« .In this paper complete classifications of quasi 2-Cayley, quasi 3-Cayley and strongly quasi 4-Cayley connected circulants are given

    (Algebraic aspects of graph theory)

    Get PDF

    Weakly distance-regular circulants, I

    Full text link
    We classify certain non-symmetric commutative association schemes. As an application, we determine all the weakly distance-regular circulants of one type of arcs by using Schur rings. We also give the classification of primitive weakly distance-regular circulants.Comment: 28 page
    corecore