Affiliation:
1. Department of Applied Artificial Intelligence, Ming Chuan University, 5 De Ming Road, Guishan District, Taoyuan City 333, Taiwan
Abstract
The clique transversal problem is a critical concept in graph theory, focused on identifying a minimum subset of vertices that intersects all maximal cliques in a graph. This problem and its variations—such as the k-fold clique, {k}-clique, minus clique, and signed clique transversal problems—have received significant interest due to their theoretical importance and practical applications. This paper examines the k-fold clique, {k}-clique, minus clique, and signed clique transversal problems on distance-hereditary graphs. Known for their distinctive structural properties, distance hereditary graphs provide an ideal framework for studying these problem variants. By exploring these issues in the context of distance-hereditary graphs, this research enhances the understanding of the computational challenges and the potential for developing efficient algorithms to address these problems.
Funder
National Science and Technology Council
Reference24 articles.
1. A characterization of distance-hereditary graphs;Howorka;Q. J. Math. Second. Ser.,1977
2. Distance-hereditary graphs;Bandelt;J. Comb. Theory Ser. B,1986
3. The axiomatic characterization of the interval function of distance hereditary graphs;Changat;Discret. Appl. Math.,2024
4. Mutual-visibility in distance-hereditary graphs: A linear-time algorithm;Cicerone;Procedia Comput. Sci.,2023
5. Eccentricity function in distance-hereditary graphs;Dragan;J. Comb. Theory Ser. B,2020