Abstract
We have formalized the definition of graph labeling in terms of combinatorial configurations. We have investigated the connection between edge and vertex (a, d)–distance antimagic labelings with such well-known configurations as separating systems and magic rectangle sets. We have obtained a solution to the problem of construction of indicated labelings for some types of graphs and certain values of a and d.
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
