Abstract
The even adjacency split problem is defined as follows: given an undirected graph, determine whether its vertex set can be partitioned into two dominating sets whose sizes differ by at most one. We show that the problem is NP-complete for general graphs. We also present two algorithms for restricted classes of graphs: first, an algorithm with time complexity linear in the number of edges that finds such a partition for all graphs which contain no isolated vertices and no vertex adjacent to more than two vertices of degree one; and second, an algorithm which determines if such a partition exists for a tree with n vertices in time O( n 2).
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
