The super-connected property of recursive circulant graphs (Q2390328): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q2760442 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding trees in recursive circulants / rank
 
Normal rank
Property / cites work
 
Property / cites work: The super connectivity of the pancake graphs and the super laceability of the star graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjoint Hamiltonian cycles in recursive circulant graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive circulants and their embeddings among hypercubes / rank
 
Normal rank

Latest revision as of 20:02, 1 July 2024

scientific article
Language Label Description Also known as
English
The super-connected property of recursive circulant graphs
scientific article

    Statements

    The super-connected property of recursive circulant graphs (English)
    0 references
    0 references
    0 references
    0 references
    21 July 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    super-connected
    0 references
    container
    0 references
    recursive circulant
    0 references
    interconnection networks
    0 references
    0 references