Notes on \(L(1,1)\) and \(L(2,1)\) labelings for \(n\)-cube (Q489710): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Hai-ying Zhou / rank
Normal rank
 
Property / author
 
Property / author: Hai-ying Zhou / rank
 
Normal rank
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.1007/s10878-012-9568-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2045359810 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Labelling Graphs with a Condition at Distance 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \(L(d,1)\)-labelings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3322121 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3340907 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pair Labellings with Given Distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Further Results on T-Coloring and Frequency Assignment Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: List \(T\)-colorings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the $\lambda$-Number of $Q_n $ and Related Graphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:40, 9 July 2024

scientific article
Language Label Description Also known as
English
Notes on \(L(1,1)\) and \(L(2,1)\) labelings for \(n\)-cube
scientific article

    Statements

    Notes on \(L(1,1)\) and \(L(2,1)\) labelings for \(n\)-cube (English)
    0 references
    0 references
    0 references
    0 references
    21 January 2015
    0 references
    channel assignment problem
    0 references
    distance two labeling
    0 references
    \(n\)-cube
    0 references

    Identifiers