Chromatic sets of power graphs and their application to resource placement in multicomputer networks

DOI10.1016/j.camwa.2009.01.043zbMath1189.68083OpenAlexW2022077517MaRDI QIDQ980032

Selim G. Akl, N. Imani, P. Moinzadeh, Hamid Sarbazi-Azad

Publication date: 28 June 2010

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.camwa.2009.01.043

zbMATH Keywords

hypercubechromatic numberinterconnection networkssymmetric graphspower graphsresource placementsparse placement

Mathematics Subject Classification ID

Applications of graph theory (05C90) Communication networks in operations research (90B18) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15)

Related Items (4)

The \(b\)-chromatic number of powers of hypercube ⋮ On \(b\)-coloring of powers of hypercubes ⋮ Intersection graphs of general linear groups ⋮ On the connectivity and equality of some graphs on finite semigroups

Cites Work

• Perfect distance-\(d\) placements in 2D toroidal networks
• Perfect elimination orderings of chordal powers of graphs
• Packing two copies of a tree into its fourth power
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Chromatic sets of power graphs and their application to resource placement in multicomputer networks