Abstract
The problems of counting independent sets and maximal independent sets are #P-complete for tree convex bipartite graphs but solvable in polynomial time for its subclass of convex bipartite graphs. This study investigates these problems for so-called path–treebipartite graphs, which are a subclass of bipartite graphs between tree convex bipartite graphs and convex bipartite graphs. A bipartite graph G with bipartition (X, Y) is called a path-tree bipartite graph, if a tree T that is defined on X exists such that, for all vertices y in Y, the neighbors of y form a path in T. This study reveals that the problems of counting independent sets and maximal independent sets remain #P-complete even for path-tree bipartite graphs but a stricter restriction to rooted path–tree bipartite graphs admits polynomial-time solutions.
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.
