Chromatic sets of power graphs and their application to resource placement in multicomputer networks (Q980032): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Perfect distance-\(d\) placements in 2D toroidal networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952682 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect elimination orderings of chordal powers of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3808118 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4483922 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing two copies of a tree into its fourth power / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2718334 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4039784 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5286666 / rank
 
Normal rank

Latest revision as of 23:50, 2 July 2024

scientific article
Language Label Description Also known as
English
Chromatic sets of power graphs and their application to resource placement in multicomputer networks
scientific article

    Statements

    Chromatic sets of power graphs and their application to resource placement in multicomputer networks (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    28 June 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    interconnection networks
    0 references
    resource placement
    0 references
    symmetric graphs
    0 references
    power graphs
    0 references
    chromatic number
    0 references
    hypercube
    0 references
    sparse placement
    0 references
    0 references