An upper bound of radio k-coloring problem and its integer linear programming model
Authors:
- 18 March 2019
- journal article
- research article
- Published by Springer Nature in Wireless Networks
- Vol. 26 (7) , 4955-4964
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- A lower bound for radio-chromatic numberDiscrete Applied Mathematics, 2015
- ON RADIO NUMBER OF POWER OF CYCLESAsian-European Journal of Mathematics, 2011
- Radio numbers for generalized prism graphsDiscussiones Mathematicae Graph Theory, 2011
- An improved lower bound for the radio -chromatic number of the hypercubeComputers & Mathematics with Applications, 2010
- Optimal radio labellings of complete -ary treesDiscrete Applied Mathematics, 2010
- Radio number for treesDiscrete Mathematics, 2008
- Linear and cyclic radio k-labelings of treesDiscussiones Mathematicae Graph Theory, 2007
- Multilevel Distance Labelings for Paths and CyclesSIAM Journal on Discrete Mathematics, 2005
- A Textbook of Graph Theory2000
- Frequency assignment: Theory and applicationsProceedings of the IEEE, 1980