Abstract
A bipartite graph G(X, Y) is called a star convex bipartite graph with convexity on X if there is an associated star T on X such that for each vertex in Y, its neighborhood induces a subtree in T. A split graph G(K, I) is a graph that can be partitioned into a clique (K) and an independent set (I). The objective of this study is twofold: (i) to strengthen the results presented in [1] for the Hamiltonian cycle (HCYCLE), the Hamiltonian path (HPATH), and Domination (DS) problems on star convex bipartite graphs (ii) to reinforce the results of [2] for HCYCLE, and HPATH on split graphs by introducing convex ordering on one of the partitions (clique or independent set). We establish the following dichotomy results on star convex bipartite graphs: (i) HCYCLE is NP-complete for diameter 3, and polynomial-time solvable for diameter 2, 5, and 6 (ii) HPATH is polynomial-time solvable for diameter 2, and NP-Complete, otherwise. Note that HCYCLE and HPATH are NP-complete on star convex bipartite graphs with diameter 4 1. Similarly, we present the following results on split graphs by imposing convexity on K (I); HCYCLE and HPATH are NP-complete on star (comb) convex split graphs with convexity on K (I). On the positive side, we show that for \(K_{1,5}\)-free star convex split graphs with convexity on I, HCYCLE is polynomial-time solvable.
We further show that the domination problem and its variants (Connected, Total, Outer-Connected, and Dominating biclique) are NP-complete on star convex bipartite graphs with diameter 3 (diameter 5, diameter 6). On the parameterized complexity front, we prove that the parameterized version of the domination problem, with the parameter being the solution size, is not fixed-parameter tractable on star convex bipartite graphs with a diameter at most 4, whereas it is fixed-parameter tractable when the parameter is the number of leaves in the associated star.
This work is partially supported by NBHM project, NBHM/02011/24/2023/6051.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Chen, H., Lei, Z., Liu, T., Tang, Z., Wang, C., Xu, K.: Complexity of domination, hamiltonicity and treewidth for tree convex bipartite graphs. J. Comb. Optim. 32(1), 95–110 (2016)
Müller, H.: Hamiltonian circuits in chordal bipartite graphs. Discret. Math. 156(1–3), 291–298 (1996)
Spinrad, J., Brandstädt, A., Stewart, L.: Bipartite permutation graphs. Discret. Appl. Math. 18(3), 279–292 (1987)
Jiang, W., Liu, T., Wang, C., Xu, K.: Feedback vertex sets on restricted bipartite graphs. Theor. Comput. Sci. 507, 41–51 (2013)
Cyman, J.: The outer-connected domination number of a graph. Australas. J. Comb. 38, 35–46 (2007)
Panda, B.S., Pandey, A.: Algorithm and hardness results for outer-connected dominating set in graphs. In: Pal, S.P., Sadakane, K. (eds.) WALCOM 2014. LNCS, vol. 8344, pp. 151–162. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-04657-0_16
Pradhan, D.: On the complexity of the minimum outer-connected dominating set problem in graphs. J. Comb. Optim. 31(1), 1–12 (2016)
Pandey, A., Panda, B.S.: Domination in some subclasses of bipartite graphs. Discrete Appl. Math. 252, 51–66 (2019)
Telle, J.A., Villanger, Y.: FPT algorithms for domination in biclique-free graphs. In: Epstein, L., Ferragina, P. (eds.) ESA 2012. LNCS, vol. 7501, pp. 802–812. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-33090-2_69
Renjith, P., Sadagopan, N.: Hamiltonian cycle in \(K_{1, r}\)-free split graphs-a dichotomy. Int. J. Found. Comput. Sci. 33(01), 1–32 (2022)
Renjith, P., Sadagopan, N.: Hamiltonian path in \(K_{1,t}\)-free split graphs- a dichotomy. In: Panda, B.S., Goswami, P.P. (eds.) CALDAM 2018. LNCS, vol. 10743, pp. 30–44. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-74180-2_3
Mohanapriya, A., Renjith, P., Sadagopan, N.: P versus NPC: minimum Steiner trees in convex split graphs. In: Balachandran, N., Inkulu, R. (eds.) CALDAM 2022. LNCS, vol. 13179, pp. 115–126. Springer, Cham (2022). https://doi.org/10.1007/978-3-030-95018-7_10
Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York (1980)
West, D.B.: Introduction to Graph Theory, 2nd edn. Prentice hall, Upper Saddle River (2003)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2024 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Mahendra Kumar, R., Sadagopan, N. (2024). Impact of Diameter and Convex Ordering for Hamiltonicity and Domination. In: Kalyanasundaram, S., Maheshwari, A. (eds) Algorithms and Discrete Applied Mathematics. CALDAM 2024. Lecture Notes in Computer Science, vol 14508. Springer, Cham. https://doi.org/10.1007/978-3-031-52213-0_14
Download citation
DOI: https://doi.org/10.1007/978-3-031-52213-0_14
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-52212-3
Online ISBN: 978-3-031-52213-0
eBook Packages: Computer ScienceComputer Science (R0)