The (strong) rainbow connection numbers of Cayley graphs on abelian groups (Q2429053): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2150490129 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1011.0827 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive circulants and their embeddings among hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding trees in recursive circulants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extraconnectivity of hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow connection in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The rainbow connectivity of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The rainbow connection of a graph is (at most) reciprocal to its minimum degree / rank
 
Normal rank

Latest revision as of 03:04, 5 July 2024

scientific article
Language Label Description Also known as
English
The (strong) rainbow connection numbers of Cayley graphs on abelian groups
scientific article

    Statements

    The (strong) rainbow connection numbers of Cayley graphs on abelian groups (English)
    0 references
    0 references
    0 references
    0 references
    22 April 2012
    0 references
    0 references
    edge-coloring
    0 references
    rainbow path
    0 references
    (strong) rainbow connection number
    0 references
    abelian group
    0 references
    Cayley graph
    0 references
    recursive circulant
    0 references
    0 references
    0 references