Channel Assignment and Graph Labeling

2003 ◽  
pp. 95-117 ◽  
Author(s):  
Jeannette C. M. Janssen
Keyword(s):  
Channel Assignment ◽  
Graph Labeling

Graph labeling and radio channel assignment

1998 ◽  
Vol 29 (4) ◽  
pp. 263-283 ◽  
Author(s):  
J. van den Heuvel ◽  
R. A. Leese ◽  
M. A. Shepherd
Keyword(s):  
Channel Assignment ◽  
Radio Channel ◽  
Graph Labeling

scholarly journals Radio Mean Labeling Of Paths And Its Total Graph

2021 ◽  
Vol 12 (1S) ◽  
pp. 343-350
Author(s):  
Meera Saraswathi, Et. al.
Keyword(s):  
Channel Assignment ◽  
Radio Channel ◽  
Graph Labeling ◽  
Total Graph ◽  
Mathematical Condition ◽  
Significant Application

A graph labeling problem is an assignment of labels to the vertices or edges (or both) of a graph G satisfying some mathematical condition. Radio Mean Labeling, a vertex-labeling of graphs with non-negative integers has a significant application in the study of problems related to radio channel assignment. The maximum label used in a radio mean labeling is called its span, and the lowest possible span of a radio mean labeling is called the radio mean number of a graph. In this paper, we obtain the radio mean number of paths and total graph of paths.

Design a Cellular System with Different Cluster Size and Investigate the Co Channel Interference Assuming a Limited Geographical Area with Fixed Channel Assignment Strategy

2017 ◽  
Vol 3 (04) ◽  
Author(s):  
Md.Taz Uddin, Ahmed al Marzean, Md Rafiqul Islam, Shahjahan Ahmed
Keyword(s):  
Channel Assignment ◽  
Cluster Size ◽  
Geographical Area ◽  
Cellular System ◽  
Communication Industry ◽  
Mobile Operator ◽  
Channel Interference ◽  
Assignment Strategy ◽  
Fixed Channel Assignment ◽  
Mobile Communication Industry

There are different communication standards in present mobile communication industry. Each of this standards has its own feature, architecture, and channel assignment strategies. Each mobile operator uses one of any standard and their aim is to support as much user as possible to communicate with tolerable interference. For that reason they use different cluster size and frequency planning to cover entire geographical area. To reuse the given bandwidth within the entire geographical area some cells uses same sets of frequency and interference arise when the distance between these cells is small. Also when distance is large then capacity is going low. In this thesis our work is to investigation the co channel interference among different cluster size assuming a limited sub urban geographical area in a cellular GSM network. Also we calculate the number of users using each of this cluster size and finally design a cellular system in this geographical area using best results (minimum interference and maximum capacity).

A STUDY ON FUZZY EQUITABLE EDGE COLORING OF WHEEL RELATED GRAPHS

2020 ◽  
Vol 9 (11) ◽  
pp. 9311-9317
Author(s):  
K. Sivaraman ◽  
R.V. Prasad
Keyword(s):  
Edge Coloring ◽  
Graph Labeling ◽  
Equitable Edge Coloring

Equitable edge coloring is a kind of graph labeling with the following restrictions. No two adjacent edges receive same label (color). and number of edges in any two color classes differ by at most one. In this work we are going to present the Fuzzy equitable edge coloring of some wheel related graphs.

Sign in / Sign up

Export Citation Format

Share Document