New \(L(j,k)\)-labelings for direct products of complete graphs (Q514706): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.11650/tjm.18.2014.3045 / rank
Normal rank
 
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C78 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6693426 / rank
 
Normal rank
Property / zbMATH Keywords
 
\(L(j
Property / zbMATH Keywords: \(L(j / rank
 
Normal rank
Property / zbMATH Keywords
 
k)\)-labelings
Property / zbMATH Keywords: k)\)-labelings / rank
 
Normal rank
Property / zbMATH Keywords
 
direct product of graphs
Property / zbMATH Keywords: direct product of graphs / rank
 
Normal rank
Property / zbMATH Keywords
 
complete graph
Property / zbMATH Keywords: complete graph / rank
 
Normal rank
Property / zbMATH Keywords
 
channel-assignment problem
Property / zbMATH Keywords: channel-assignment problem / 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.11650/tjm.18.2014.3045 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2022859136 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.11650/TJM.18.2014.3045 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 20:00, 9 December 2024

scientific article
Language Label Description Also known as
English
New \(L(j,k)\)-labelings for direct products of complete graphs
scientific article

    Statements

    New \(L(j,k)\)-labelings for direct products of complete graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    9 March 2017
    0 references
    \(L(j
    0 references
    k)\)-labelings
    0 references
    direct product of graphs
    0 references
    complete graph
    0 references
    channel-assignment problem
    0 references

    Identifiers