Manuscript Number : IJSRSET184950
A Study on Perfect 3 Coloring of Cubic Graph of Order 10
Authors(2) :-K S Dilip, T. Ramesh
Perfect coloring is a generalization of the notion of completely regular code. This thesis entitled “ A STUDY OF PERFECT 3 COLORING OF CUBIC GRAPH OF ORDER 10” examines the idea identified with perfectly coloring a cubic graph of order 10. A perfect m coloring of a graph G with m colors is a partition of vertex set of G into m parts A1, A 2, A 3 …..Am such that, for all i,j every vertex of Ai is adjacent to the same number of vertices, namely, aij vertices of Aj and we classify the realizable coloring of parameter matrix (symmetric)of perfect 3-colorings for the cubic graph of order 10.
K S Dilip
Perfect Colouring, Parameter Matrix, Peterson Graphs.
Publication Details
Published in :
Volume 4 | Issue 9 | July-August 2018 Article Preview
M. Phil Scholar, Department of Mathematics, Dr. SNS. Rajalaksmi College of arts and science, Coimbatore, Tamilnadu, India
T. Ramesh
Assistant Professor, Department of Mathematics, Dr. SNS. Rajalaksmi College of arts and science, Coimbatore, Tamilnadu, India
Date of Publication :
2018-07-30
License: This work is licensed under a Creative Commons Attribution 4.0 International License.
Page(s) :
276-281
Manuscript Number :
IJSRSET184950
Publisher : Technoscience Academy
Journal URL :
https://ijsrset.com/IJSRSET184950