Optimal L ( d, 1 ) -Labeling of Certain Direct Graph Bundles Cycles over Cycles and Cartesian Graph Bundles Cycles over Cycles

Irena Hrastnik Ladinek ()
Additional contact information
Irena Hrastnik Ladinek: Faculty of Mechanical Engineering, University of Maribor, Smetanova 17, 2000 Maribor, Slovenia

Mathematics, 2024, vol. 12, issue 19, 1-13

Abstract: An L ( d , 1 ) -labeling of a graph G = ( V , E ) is a function f from the vertex set V ( G ) to the set of nonnegative integers such that the labels on adjacent vertices differ by at least d and the labels on vertices at distance two differ by at least one, where d ≥ 1 . The span of f is the difference between the largest and the smallest numbers in f ( V ) . The λ 1 d -number of G , denoted by λ 1 d ( G ) , is the minimum span over all L ( d , 1 ) -labelings of G . We prove that λ 1 d ( X ) ≤ 2 d + 2 , with equality if 1 ≤ d ≤ 4 , for direct graph bundle X = C m × σ ℓ C n and Cartesian graph bundle X = C m □ σ ℓ C n , if certain conditions are imposed on the lengths of the cycles and on the cyclic ℓ -shift σ ℓ .

Keywords: L ( d , 1 ) -labeling; ? 1 d -number; direct product of graph; direct graph bundle; Cartesian product of graph; Cartesian graph bundle; cyclic ? -shift; channel assignment (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2024
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/12/19/3121/pdf (application/pdf)
https://www.mdpi.com/2227-7390/12/19/3121/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:12:y:2024:i:19:p:3121-:d:1492765

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().