\(l(3,2,1)\)-labeling for the product of a complete graph and a cycle (Q514887): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 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.11650/tjm.19.2015.4632 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1596060973 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Radio number for trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3073573 / 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: A survey on labeling graphs with a condition at distance two / rank
 
Normal rank
Property / cites work
 
Property / cites work: A distance-labelling problem for hypercubes / rank
 
Normal rank

Latest revision as of 12:34, 13 July 2024

scientific article
Language Label Description Also known as
English
\(l(3,2,1)\)-labeling for the product of a complete graph and a cycle
scientific article

    Statements

    \(l(3,2,1)\)-labeling for the product of a complete graph and a cycle (English)
    0 references
    0 references
    0 references
    0 references
    9 March 2017
    0 references
    distance three labeling
    0 references
    \(L(3
    0 references
    2
    0 references
    1)\)-labeling
    0 references
    Cartesian products
    0 references
    graph labeling
    0 references

    Identifiers