Abstract
The square of a graph \(G\), denoted \(G^2\), is obtained from \(G\) by putting an edge between two distinct vertices whenever their distance is two. Then \(G\) is called a square root of \(G^2\). Deciding whether a given graph has a square root is known to be NP-complete, even if the root is required to be a chordal graph or even a split graph.
We present a polynomial time algorithm that decides whether a given graph has a ptolemaic square root. If such a root exists, our algorithm computes one with a minimum number of edges.
In the second part of our paper, we give a characterization of the graphs that admit a 3-sun-free split square root. This characterization yields a polynomial time algorithm to decide whether a given graph has such a root, and if so, to compute one.
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
Adamszek, A., Adamszek, M.: Large-girth roots of graphs. SIAM J. Discrete Math. 24, 1501–1514 (2010)
Adamszek, A., Adamszek, M.: Uniqueness of graph square roots of girth six. Electron. J. Combin. 18, 139 (2011)
Bandelt, H.-J., Henkmann, A., Nicolai, F.: Powers of distance-hereditary graphs. Disc. Math. 145, 37–60 (1995)
Bandelt, H.-J., Mulder, H.M.: Distance-hereditary graphs. J. Combin. Theory (Ser. B) 41, 182–208 (1986)
Brandstädt, A., Le, V.B., Spinrad, J.P.: Graph Classes: A Survey. SIAM, Philadelphia (1999)
Chang, M.-S., Ko, M.-T., Lu, H.-I.: Linear-time algorithms for tree root problems. In: Arge, L., Freivalds, R. (eds.) SWAT 2006. LNCS, vol. 4059, pp. 411–422. Springer, Heidelberg (2006)
Cochefert, M., Couturier, J.-F., Golovach, P.A., Kratsch, D., Paulusma, D.: Sparse square roots. In: Brandstädt, A., Jansen, K., Reischuk, R. (eds.) WG 2013. LNCS, vol. 8165, pp. 177–188. Springer, Heidelberg (2013)
Dalhaus, E., Duchet, P.: On strongly chordal graphs. Ars Combin. 24B, 23–30 (1987)
Dourado, M.C., Protti, F., Szwarcfiter, J.L.: Complexity aspects of the helly property: graphs and hypergraphs. Electron. J. Combin. 17, 1–53 (2009)
Farzad, B., Karimi, M.: Square-root finding problem in graphs, a complete dichotomy theorem, arXiv:1210.7684 (2012)
Farzad, B., Lau, L.C., Le, V.B., Tuy, N.N.: Complexity of finding graph roots with girth conditions. Algorithmica 62, 38–53 (2012)
Hammer, P.L., Maffray, F.: Completely separable graphs. Disc. App. Math. 27, 85–99 (1990)
Howorka, E.: A characterization of ptolemaic graphs. J. Graph Theory 5, 323–331 (1981)
Lau, L.C.: Bipartite roots of graphs. ACM Trans. Algorithms 2, 178–208 (2006)
Lau, L.C., Corneil, D.G.: Recognizing powers of proper interval, split, and chordal graphs. SIAM J. Discrete Math. 18, 83–102 (2004)
Le, V.B., Nguyen, N.T.: Hardness results and efficient algorithms for graph powers. In: Paul, C., Habib, M. (eds.) WG 2009. LNCS, vol. 5911, pp. 238–249. Springer, Heidelberg (2010)
Le, V.B., Tuy, N.N.: The square of a block graph. Disc. Math. 310, 734–741 (2010)
Le, V.B., Tuy, N.N.: A good characterization of squares of strongly chordal split graphs. Inf. Process. Lett. 310, 120–123 (2011)
Lubiw, A.: Doubly lexical orderings of matrices. SIAM J. Comput. 16, 854–879 (1987)
Milanič, M., Schaudt, O.: Computing square roots of trivially perfect and threshold graphs. Disc. App. Math. 161, 1538–1545 (2013)
Motwani, R., Sudan, M.: Computing roots of graphs is hard. Disc. App. Math. 54, 81–88 (1994)
Prisner, E.: Hereditary clique-Helly graphs. J. Comb. Math. Comb. Comput. 14, 216–220 (1993)
Raychaudhuri, A.: On powers of strongly chordal and circular arc graphs. Ars Combin. 34, 147–160 (1992)
Tsukiyama, S., Ide, M., Ariyoshi, H., Shirakawa, I.: A new algorithm for generating all the maximal independent sets. SIAM J. Comput. 6, 505–517 (1977)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Le, V.B., Oversberg, A., Schaudt, O. (2014). Polynomial Time Recognition of Squares of Ptolemaic Graphs and 3-sun-free Split Graphs. In: Kratsch, D., Todinca, I. (eds) Graph-Theoretic Concepts in Computer Science. WG 2014. Lecture Notes in Computer Science, vol 8747. Springer, Cham. https://doi.org/10.1007/978-3-319-12340-0_30
Download citation
DOI: https://doi.org/10.1007/978-3-319-12340-0_30
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-12339-4
Online ISBN: 978-3-319-12340-0
eBook Packages: Computer ScienceComputer Science (R0)