A Study on Perfect 3 Coloring of Cubic Graph of Order 10
Keywords:
Perfect Colouring, Parameter Matrix, Peterson Graphs.Abstract
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.
References
- M Alaeiyan and A. Abedi, Perfect 2-colorings of Johnson graphs J(4, 3), J(4, 3), J(6, 3) and Petersen graph, Ars Combinatoria, (to appear).
- FC. Bussemaker, S. Cobeljic, D.M. Cvetkovic and J.J. Seidel, Computer invetigation of cubic graphs, Technische Hpgesschool Eindhoven Nederland Onderafedeling Der Wiskunde, January 1976. 205 www.ejgta.org Perfect 3-colorings of the cubic graphs of order 10 | M. Alaeiyan and A. Mehrabani.
- SV. Avgustinovich and I. Yu. Mogilnykh, Perfect 2-colorings of Johnson graphs J(6, 3) and J(7, 3), Lecture Notes in Computer Science 5228 (2008), 11–19.
- DG. Fon-Der-Flaass, Perfect 2-colorings of a hypercube, Siberian Mathematical Journal 4 (2007), 923–930.
Downloads
Published
Issue
Section
License
Copyright (c) IJSRSET

This work is licensed under a Creative Commons Attribution 4.0 International License.