scholarly journals Spectrum Graph Coloring and Applications to Wi-Fi Channel Assignment

Symmetry ◽  
2018 ◽  
Vol 10 (3) ◽  
pp. 65 ◽  
Author(s):  
David Orden ◽  
Jose Gimenez-Guzman ◽  
Ivan Marsa-Maestre ◽  
Enrique de la Hoz
Keyword(s):  
Graph Coloring ◽  
Channel Assignment ◽  
Spectrum Graph

scholarly journals Spectrum graph coloring to improve Wi-Fi channel assignment in a real-world scenario via edge contraction

2019 ◽  
Vol 263 ◽  
pp. 234-243 ◽  
Author(s):  
David Orden ◽  
Ivan Marsa-Maestre ◽  
Jose Manuel Gimenez-Guzman ◽  
Enrique de la Hoz ◽  
Ana Álvarez-Suárez
Keyword(s):  
Graph Coloring ◽  
Real World ◽  
Channel Assignment ◽  
Edge Contraction ◽  
Spectrum Graph

scholarly journals Bounds on spectrum graph coloring

2016 ◽  
Vol 54 ◽  
pp. 63-68 ◽  
Author(s):  
David Orden ◽  
Ivan Marsa-Maestre ◽  
Jose Manuel Gimenez-Guzman ◽  
Enrique de la Hoz
Keyword(s):  
Graph Coloring ◽  
Spectrum Graph

scholarly journals Flight Level Assignment Using Graph Coloring

2020 ◽  
Vol 10 (18) ◽  
pp. 6157
Author(s):  
Jose Manuel Gimenez-Guzman ◽  
Alejandra Martínez-Moraian ◽  
Rene D. Reyes-Bardales ◽  
David Orden ◽  
Ivan Marsa-Maestre
Keyword(s):  
Fuel Consumption ◽  
Graph Coloring ◽  
Optimization Problem ◽  
Air Traffic ◽  
The Other ◽  
Safety Constraints ◽  
Flight Level ◽  
The One ◽  
Traffic Optimization ◽  
Spectrum Graph

This paper models an air traffic optimization problem where, on the one hand, flight operators seek to minimize fuel consumption flying at optimal cruise levels and, on the other hand, air traffic managers aim to keep intersecting airways at as distant as possible flight levels. We study such a problem as a factorized optimization, which is addressed through a spectrum graph coloring model, evaluating the effect that safety constraints have on fuel consumption, and comparing different heuristic approaches for allocation.

Graph coloring based channel assignment framework for rural wireless mesh networks

2013 ◽  
Vol 30 (5) ◽  
pp. 436-446 ◽  
Author(s):  
Chao Zuo ◽  
Cong Xiong ◽  
Han Zhang ◽  
Chang Fang
Keyword(s):  
Wireless Mesh Networks ◽  
Graph Coloring ◽  
Channel Assignment ◽  
Mesh Networks ◽  
Wireless Mesh

scholarly journals An exact algorithm for the generalized list T-coloring problem

2014 ◽  
Vol Vol. 16 no. 3 (Discrete Algorithms) ◽  
Author(s):  
Konstanty Junosza-Szaniawski ◽  
Pawel Rzazewski
Keyword(s):  
Graph Coloring ◽  
Channel Assignment ◽  
Maximum Degree ◽  
Perfect Matching ◽  
Exact Algorithm ◽  
Special Structure ◽  
Input Graph ◽  
Discrete Algorithms ◽  
International Audience ◽  
The Difference

Discrete Algorithms International audience The generalized list T-coloring is a common generalization of many graph coloring models, including classical coloring, L(p,q)-labeling, channel assignment and T-coloring. Every vertex from the input graph has a list of permitted labels. Moreover, every edge has a set of forbidden differences. We ask for a labeling of vertices of the input graph with natural numbers, in which every vertex gets a label from its list of permitted labels and the difference of labels of the endpoints of each edge does not belong to the set of forbidden differences of this edge. In this paper we present an exact algorithm solving this problem, running in time O*((τ+2)n), where τ is the maximum forbidden difference over all edges of the input graph and n is the number of its vertices. Moreover, we show how to improve this bound if the input graph has some special structure, e.g. a bounded maximum degree, no big induced stars or a perfect matching.

scholarly journals Improved Bounds for Radiok-Chromatic Number of HypercubeQn

2011 ◽  
Vol 2011 ◽  
pp. 1-7
Author(s):  
Laxman Saha ◽  
Pratima Panigrahi ◽  
Pawan Kumar
Keyword(s):  
Lower Bound ◽  
Chromatic Number ◽  
Graph Coloring ◽  
Upper Bound ◽  
Channel Assignment ◽  
Assignment Problem ◽  
Communication Problem ◽  
Channel Assignment Problem

A number of graph coloring problems have their roots in a communication problem known as the channel assignment problem. The channel assignment problem is the problem of assigning channels (nonnegative integers) to the stations in an optimal way such that interference is avoided as reported by Hale (2005). Radiok-coloring of a graph is a special type of channel assignment problem. Kchikech et al. (2005) have given a lower and an upper bound for radiok-chromatic number of hypercubeQn, and an improvement of their lower bound was obtained by Kola and Panigrahi (2010). In this paper, we further improve Kola et al.'s lower bound as well as Kchikeck et al.'s upper bound. Also, our bounds agree for nearly antipodal number ofQnwhenn≡2(mod 4).

scholarly journals Radio Number Associated with Zero Divisor Graph

Mathematics ◽  
2020 ◽  
Vol 8 (12) ◽  
pp. 2187
Author(s):  
Ali N. A. Koam ◽  
Ali Ahmad ◽  
Azeem Haider
Keyword(s):  
Graph Coloring ◽  
Channel Assignment ◽  
Zero Divisor ◽  
Prime Numbers ◽  
Radio Waves ◽  
Frequency Bands ◽  
Regulatory Authorities ◽  
Zero Divisor Graph ◽  
Radio Number

Radio antennas use different frequency bands of Electromagnetic (EM) Spectrum for switching signals in the forms of radio waves. Regulatory authorities issue a unique number (unique identifying call sign) to each radio center, that must be used in all transmissions. Each radio center propagates channels to the two nearer radio centers so they must use distinctive numbers to avoid interruption. The task of effectively apportioning channels to transmitters is known as the Channel Assignment (CA) problem. CA Problem is discussed under the topic of graph coloring by mathematicians. The radio number of a graph can be used in many parts of the field communication. In this paper, we determined the radio number of zero-divisor graphs Γ(Zp2×Zq2) for p,q prime numbers.

Sign in / Sign up

Export Citation Format

Share Document