<i>L</i>(<i>h</i>,<i>k</i>)-labelling for octagonal grid (Q2804024): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: \(L(p,q)\)-labeling of sparse graphs / 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: \(L(2,1)\)-labeling of direct product of paths and cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal \(L(d,1)\)-labelings of certain direct products of cycles and Cartesian products of cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(L(2,1)\)-labeling of strong products of cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for the Real Number Graph Labellings and Application to Labellings of the Triangular Lattice / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \(n\)-fold \(L(j,k)\)-and circular \(L(j,k)\)-labelings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(L(p,q)\)-labeling of a graph embeddable on the torus / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(L(2,1)\)-labelings of Cartesian products of two cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the $\lambda$-Number of $Q_n $ and Related Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circular \(L(j,k)\)-labeling number of direct product of path and cycle / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey on labeling graphs with a condition at distance two / rank
 
Normal rank

Latest revision as of 20:46, 11 July 2024

scientific article
Language Label Description Also known as
English
<i>L</i>(<i>h</i>,<i>k</i>)-labelling for octagonal grid
scientific article

    Statements

    <i>L</i>(<i>h</i>,<i>k</i>)-labelling for octagonal grid (English)
    0 references
    0 references
    0 references
    0 references
    27 April 2016
    0 references
    \(L(h, k)\)-labelling
    0 references
    octagonal grid
    0 references
    channel assignment problem
    0 references
    wireless network
    0 references
    strong product
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references