Combinatorial Problems on Algebraic Configured Graphs

 Unitary addition and a graph with zero divisors The intended algebraic networks are Cayley graphs. Our initial goal is to distribute frequencies throughout all of their channels (nodes) while also reducing the spectral domain usage; in this example, the upper frequency bound is given by. Decycle the targeted networks next in order to recreate them as forests or trees with reduced closeness to other objects. Let (UA(Rn)) be the cardinality of the smallest unitary addition decycling set, where UA(Rn) is the decycling number of that set. Cayley diagram A(UA(Rn); x) stands for the acyclic polynomial of UA and UA(Rn) (Rn). The frequency bound by the distance labelling constraint, which is based on the diameter of a graph, was obtained in this chapter. This time, 2;1(Rp) and

Author(s) Details:

N. Mohamed Rilwan,
Sadakathullah Appa College, Tirunelveli, Tamil Nadu, India.

R. Radha,
Sri Sarada College for Women, Tirunelveli, Tamil Nadu, India.

Please see the link here: https://stm.bookpi.org/NRAMCS-V6/article/view/7765  

Keywords: Zero divisor graph, unitary addition Cayley graph, decycling number, L(2,1)-labeling, L(3,2,1)-labeling, acyclic polynomial

Leave a Reply

Your email address will not be published.

Previous post Secured Communication using Distributed Caching Techniques
Next post δJ-Closed Sets in Topological Spaces