Edge-connectivity of regular graphs with two orbits (Q932698): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3880849 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimale \(n\)-fach kantenzusammenhängende Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connectivity of vertex and edge transitive graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimally super-edge-connected transitive graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a kind of restricted edge connectivity of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4870157 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Super restricted edge-connectivity of vertex-transitive graphs / rank
 
Normal rank

Latest revision as of 13:24, 28 June 2024

scientific article
Language Label Description Also known as
English
Edge-connectivity of regular graphs with two orbits
scientific article

    Statements

    Edge-connectivity of regular graphs with two orbits (English)
    0 references
    0 references
    0 references
    11 July 2008
    0 references
    Let \(G=(V,E)\) be a simple connected graph and \(x\in V(G)\). The set \(\{x^g : g\in Aut(G)\}\) is called an orbit of \(Aut(G)\), the automorphism group of \(G\). This paper determines the edge-connectivity of \(3\)-regular and \(4\)-regular connected graphs with two orbits, and proves the existence of \(k\)-regular \(m\)-edge-connected graphs with two orbits for some given integers \(k\) and \(m\). Furthermore, it is proved that the edge-connectivity of a \(k\)-regular connected graph with two orbits and girth at least \(5\) attains its regular degree \(k\).
    0 references
    0 references
    0 references
    edge-connectivity
    0 references
    orbit
    0 references
    automorphism group
    0 references
    regular graph
    0 references
    0 references