Title of article :
Perfect 4-Colorings of the 3-Regular Graphs of Order 10
Author/Authors :
Vahedi ، Zeinab Department of Mathematics - Islamic Azad University, Karaj Branch , Maghasedi ، Mohammad Department of Mathematics - Islamic Azad University, Karaj Branch University, Karaj Branch , Alaeiyan ، Mohammad School of Mathematics - Iran University of Science and Technology
From page :
131
To page :
142
Abstract :
The perfect 𝑚-coloring with matrix 𝐴 = [𝑎𝑖𝑗] 𝑖,𝑗 ∈ {1,...,m} of a graph 𝐺 = (𝑉, 𝐸) with {1, . . . , 𝑚} color is a vertices coloring of 𝐺 with 𝑚-color so that number of vertex in color 𝑗 adjacent to a fixed vertex in color 𝑖 is 𝑎𝑖𝑗, independent of the choice of vertex in color 𝑖. The matrix 𝐴 = [𝑎𝑖𝑗 ] 𝑖,𝑗∈ {1,...,𝑚} is called the parameter matrix. We study the perfect 4-colorings of the 3-regular graphs of order 10, that is, we determine a list of all color parameter matrices corresponding to perfect colorings of 3-regular graphs of order 10.
Keywords :
Perfect coloring , Parameter matrices , Cubic graph , Equitable partition
Journal title :
Global Analysis and Discrete Mathematics
Journal title :
Global Analysis and Discrete Mathematics
Record number :
2712490
Link To Document :
بازگشت