Antibandwidth and Cyclic Antibandwidth of Hamming Graphs (Q2851478): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Antibandwidth of Complete k-Ary Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian powers in threshold and arborescent comparability graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Powers of Hamiltonian paths in interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Some Variants of the Bandwidth Minimization Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the separation number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Antibandwidth and cyclic antibandwidth of meshes and hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separation numbers of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Antibandwidth of three-dimensional meshes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On explicit formulas for bandwidth and antibandwidth of hypercubes / rank
 
Normal rank

Latest revision as of 23:23, 6 July 2024

scientific article
Language Label Description Also known as
English
Antibandwidth and Cyclic Antibandwidth of Hamming Graphs
scientific article

    Statements