\(L(2,1)\)-labeling of direct product of paths and cycles (Q1764815): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
Property / DOI | |||
Property / DOI: 10.1016/j.dam.2004.01.019 / rank | |||
Property / DOI | |||
Property / DOI: 10.1016/J.DAM.2004.01.019 / rank | |||
Normal rank |
Latest revision as of 09:32, 11 December 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | \(L(2,1)\)-labeling of direct product of paths and cycles |
scientific article |
Statements
\(L(2,1)\)-labeling of direct product of paths and cycles (English)
0 references
22 February 2005
0 references
An \(L(2,\, 1)\)-labeling of a graph \(G\) is an assignment of labels from \(\{0,1,\dots,\lambda\}\) to the vertices of \(G\) such that vertices at distance two get different labels and adjacent vertices get labels that are at least two apart. The \(\lambda\)-number of \(G\) is the minimum value \(\lambda\), such that \(G\) admits an \(L(2,\, 1)\)-labeling. The authors establish \(\lambda\)-numbers for certain products of cycles and paths.
0 references
Vertex labeling
0 references
\(\lambda\)-number
0 references
Direct product of graphs
0 references
Rotagraph
0 references
Fasciagraph
0 references
Channel assignment
0 references
Dynamic algorithm
0 references
0 references
0 references