Distance two edge labelings of lattices

Wensong Lin () and Jianzhuan Wu
Additional contact information
Wensong Lin: Southeast University
Jianzhuan Wu: Southeast University

Journal of Combinatorial Optimization, 2013, vol. 25, issue 4, No 14, 679 pages

Abstract: Abstract Suppose G is a graph. Two edges e and e′ in G are said to be adjacent if they share a common end vertex, and distance two apart if they are nonadjacent but both are adjacent to a common edge. Let j and k be two positive integers. An L(j,k)-edge-labeling of a graph G is an assignment of nonnegative integers, called labels, to the edges of G such that the difference between labels of any two adjacent edges is at least j, and the difference between labels of any two edges that are distance two apart is at least k. The minimum range of labels over all L(j,k)-edge-labelings of a graph G is called the L(j,k)-edge-labeling number of G, denoted by $\lambda_{j,k}'(G)$ . Let m, j and k be positive integers. An m-circular-L(j,k)-edge-labeling of a graph G is an assignment f from {0,1,…,m−1} to the edges of G such that, for any two edges e and e′, |f(e)−f(e′)| m ≥j if e and e′ are adjacent, and |f(e)−f(e′)| m ≥k if e and e′ are distance two apart, where |a| m =min{a,m−a}. The minimum m such that G has an m-circular-L(j,k)-edge-labeling is called the circular-L(j,k)-edge-labeling number of G, denoted by $\sigma_{j,k}'(G)$ . This paper investigates the L(1,1)-edge-labeling numbers, the L(2,1)-edge-labeling numbers and the circular-L(2,1)-edge-labeling numbers of the hexagonal lattice, the square lattice, the triangular lattice and the strong product of two infinite paths.

Keywords: L(j; k)-edge-labeling number; Circular-L(j; k)-edge-labeling number; Strong chromatic index; Triangular lattice; Hexagonal lattice; Square lattice; Strong product (search for similar items in EconPapers)
Date: 2013
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-012-9508-5 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

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:spr:jcomop:v:25:y:2013:i:4:d:10.1007_s10878-012-9508-5

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-012-9508-5

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().