System Maintenance:
There may be intermittent impact on performance while updates are in progress. We apologize for the inconvenience.
By Topic

The Δ2-conjecture for L(2,1)-labelings is true for direct and strong products of graphs

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Klavzar, S. ; Univ. of Maribor, Slovenia ; Spacapan, S.

A variation of the channel-assignment problem is naturally modeled by L(2,1)-labelings of graphs. An L(2,1)-labeling of a graph G is an assignment of labels from {0,1,...,λ} 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 and the λ-number λ(G) of G is the minimum value λ such that G admits an L(2,1)-labeling. The Δ2-conjecture asserts that for any graph G its λ-number is at most the square of its largest degree. In this paper it is shown that the conjecture holds for graphs that are direct or strong products of nontrivial graphs. Explicit labelings of such graphs are also constructed.

Published in:

Circuits and Systems II: Express Briefs, IEEE Transactions on  (Volume:53 ,  Issue: 4 )