One-to-one disjoint path covers on alternating group graphs (Q476856): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68R10 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C38 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C70 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6375975 / rank
 
Normal rank
Property / zbMATH Keywords
 
alternating group graph
Property / zbMATH Keywords: alternating group graph / rank
 
Normal rank
Property / zbMATH Keywords
 
one-to-one disjoint path covers
Property / zbMATH Keywords: one-to-one disjoint path covers / rank
 
Normal rank
Property / zbMATH Keywords
 
interconnection network
Property / zbMATH Keywords: interconnection network / rank
 
Normal rank
Property / zbMATH Keywords
 
parallel computing
Property / zbMATH Keywords: parallel computing / rank
 
Normal rank

Revision as of 18:11, 30 June 2023

scientific article
Language Label Description Also known as
English
One-to-one disjoint path covers on alternating group graphs
scientific article

    Statements

    One-to-one disjoint path covers on alternating group graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    2 December 2014
    0 references
    alternating group graph
    0 references
    one-to-one disjoint path covers
    0 references
    interconnection network
    0 references
    parallel computing
    0 references

    Identifiers