Abstract
In this paper, we study perfect 2-coloring of the quartic graphs with at most 8 vertices.The problem of the existence of perfect coloring is a generalization of the concept of completely regular codes, given by Delsarte.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
