Abstract
In this article, we investigate the relation between dominating sets and 1-perfect codes. We also study perfect colorings of some Johnson graphs in two colors using linear programming problem.
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 callMore From: International Journal of Nonlinear Analysis and Applications
Paper Title
Journal
Date
