Abstract
A DE-pair (ODE-pair) in a graph consists of two disjoint subsets of vertices with the same closed neighborhood (open neighborhood). We consider the question of determining the smallest and largest subsets over all such pairs. We provide sharp bounds on these for general graphs and for trees, and show that the associated parameters are computable for trees but intractable in general.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: AKCE International Journal of Graphs and Combinatorics
Disclaimer: 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.