New results on radio \(k\)-labelings of distance graphs (Q2161267)

From MaRDI portal
Revision as of 03:45, 1 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
New results on radio \(k\)-labelings of distance graphs
scientific article

    Statements

    New results on radio \(k\)-labelings of distance graphs (English)
    0 references
    0 references
    0 references
    0 references
    4 August 2022
    0 references
    In this paper, the radio \(k\)-labelings of some families of distance graphs are considered. Some improved theoretical lower and upper bounds on the radio \(k\)-labeling number are presented and some computer-based methods for computing radio \(k\)-labelings of these families of graphs are proposed.
    0 references
    radio \(k\)-labeling
    0 references
    distance graph
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references