Optimal radio-\(k\)-labelings of trees (Q2225407): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejc.2020.103203 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3082270022 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Radio number of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4665539 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance-constrained labeling of complete 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: Optimal radio labellings of complete \(m\)-ary trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Radio number for trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multilevel Distance Labelings for Paths and Cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Radio numbers for generalized prism graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Radio Number of $C_n \square C_n$ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Radio graceful Hamming graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2869309 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:25, 24 July 2024

scientific article
Language Label Description Also known as
English
Optimal radio-\(k\)-labelings of trees
scientific article

    Statements

    Optimal radio-\(k\)-labelings of trees (English)
    0 references
    0 references
    0 references
    0 references
    8 February 2021
    0 references
    0 references
    \(k\)-lower bound tree
    0 references
    radio number of a graph
    0 references
    0 references