A note on partial Cayley graphs (Q685657): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3941433 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3039368 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3780901 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Grands Graphes De Degré Et Diamètre Fixés / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4770409 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3727877 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5545191 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4721969 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3686644 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5592263 / rank
 
Normal rank

Latest revision as of 10:55, 22 May 2024

scientific article
Language Label Description Also known as
English
A note on partial Cayley graphs
scientific article

    Statements

    A note on partial Cayley graphs (English)
    0 references
    0 references
    24 October 1993
    0 references
    A vertex-transitive bipartite graph of degree 7 and diameter 3 with 78 vertices is presented. The construction of this graph is generalized to the construction of bipartite graphs with high symmetry. Let \(\Gamma\) be a group with a subgroup \(\Gamma'\) and a subset \(S\) of \(\Gamma\) disjoint to \(\Gamma'\). Then \(G\) is defined to be the bipartite graph whose vertices are the elements of \(\Gamma\) and whose edges are the pairs \((x,xs)\) with \(x\in \Gamma'\) and \(s\in S\). \(G\) is called a partial Cayley graph. The structure of such graphs is investigated.
    0 references
    0 references
    bipartite graph
    0 references
    diameter
    0 references
    partial Cayley graph
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references