Verifying the Neighbouring k-edge Coloration Technique for Bipartite Graphs
Keywords:
Bipartite color selections strategy, Chromatic k-Colouring, Minimum color-interference vertices, and Colour spectrum equity.Abstract
This paper focuses on verifying the neighbouring k-edge coloration technique for balancing multi-color problems in the bipartite graph. Thus, it eliminates triangular copies of similar colour shades while maintaining exactly two colours spacing between the edges. It is achieved by inducing bipartite color selections from two unique color sets say and . Thus, ensures the minimum colour interference exists by employing a fair version of the neighbouring k-edge colouring technique. Theoretical evidence, theorems, and proofs are discussed, and results shows the superiority for equitable colourable of Wi-Fi applications.
Downloads
Published
2023-04-04
How to Cite
Thodeti.Suresh, Dr. G. Srinivasu, Prof. E. Kesava Reddy. (2023). Verifying the Neighbouring k-edge Coloration Technique for Bipartite Graphs. SJIS-P, 35(1), 727–732. Retrieved from http://sjis.scandinavian-iris.org/index.php/sjis/article/view/391
Issue
Section
Articles