Please use this identifier to cite or link to this item:
Title: Improved bounds on the L(2,1)-number of direct and strong products of graphs
Authors: Shao, Z
Klavžar, S
Shiu, WC
Zhang, DD 
Keywords: Channel assignment
Graph direct product
Graph strong product
Issue Date: 7-Jul-2008
Publisher: IEEE Circuits and Systems Society
Source: IEEE Transactions on circuits and systems. II, Express briefs, July 2008, v. 55, no. 10, p. 685-689 How to cite?
Journal: IEEE transactions on circuits and systems. II, Express briefs 
Abstract: The frequency assignment problem is to assign a frequency which is a nonnegative integer to each radio transmitter so that interfering transmitters are assigned frequencies whose separation is not in a set of disallowed separations. This frequency assignment problem can be modelled with vertex labelings of graphs. (See PDF file for details of the abstract.)
ISSN: 1549-7747
DOI: 10.1109/TCSII.2008.921411
Rights: © 2008 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.
Appears in Collections:Journal/Magazine Article

Files in This Item:
File Description SizeFormat 
04483536.pdf179.24 kBAdobe PDFView/Open
View full-text via PolyU eLinks SFX Query
Show full item record


Last Week
Last month
Citations as of Feb 6, 2016


Citations as of Feb 5, 2016

Page view(s)

Checked on Jan 31, 2016

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.