\(\lambda _c\)-Optimally half vertex transitive graphs with regularity \(k\) (Q989453): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ipl.2009.03.001 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Conditional connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimale \(n\)-fach kantenzusammenhängende Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimally super-edge-connected transitive graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4876853 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4870157 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connectivity of transitive graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On conditional edge-connectivity of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4820526 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.IPL.2009.03.001 / rank
 
Normal rank

Latest revision as of 11:32, 10 December 2024

scientific article
Language Label Description Also known as
English
\(\lambda _c\)-Optimally half vertex transitive graphs with regularity \(k\)
scientific article

    Statements

    \(\lambda _c\)-Optimally half vertex transitive graphs with regularity \(k\) (English)
    0 references
    0 references
    0 references
    20 August 2010
    0 references
    combinatorial problems
    0 references
    half vertex transitive graph
    0 references
    cyclic edge connectivity
    0 references
    \(\lambda _c\)-optimal
    0 references
    bi-Cayley graphs
    0 references

    Identifiers