Multilevel Bandwidth and Radio Labelings of Graphs (Q5452169): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Radio k-colorings of paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2765170 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Radio antipodal colorings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The bandwidth sum of join and composition of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The bandwidth problem for graphs and matrices—a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear and cyclic radio k-labelings of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3426085 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4650002 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bandwidth of the Cartesian product of two connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extremal graph with given bandwidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph bandwidth of weighted caterpillars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multilevel Distance Labelings for Paths and Cycles / rank
 
Normal rank

Latest revision as of 19:57, 27 June 2024

scientific article; zbMATH DE number 5252767
Language Label Description Also known as
English
Multilevel Bandwidth and Radio Labelings of Graphs
scientific article; zbMATH DE number 5252767

    Statements

    Multilevel Bandwidth and Radio Labelings of Graphs (English)
    0 references
    0 references
    0 references
    25 March 2008
    0 references
    0 references
    0 references
    0 references
    0 references
    generalized graph bandwidth
    0 references
    radio labeling
    0 references
    frequency assignment
    0 references
    0 references