Abstract
A graph is said to be a pairwise compatibility graph (PCG) if there exists an edge-weighted tree whose leaf set is the graph’s vertex set, and there exists an edge between two vertices in the graph if and only if the distance between them in the tree lies within a given interval. It is a challenging task to enumerate all non-PCGs that are minimal in the sense that each of their induced subgraphs is a PCG and deliver proof of this fact. First, it involves a large number of combinatorial decisions concerning the structure of a tree and leaf-vertex correspondence. Moreover, there exists an infinite continuous domain for the edge weights even for a fixed tree. We handle the combinatorial problem by first screening graphs that are PCGs using a heuristic PCG generator. Then, we construct “configurations” that show some graphs to be PCGs. Finally, we generate configurations without including those that cannot be used to show that a given graph is a PCG. In order to construct finite-sized evidence to a graph being a minimal non-PCG in the face of an infinite search space, we use linear programming (LP) formulations whose solutions serve as evidence. To demonstrate our approach, we enumerated all minimal non-PCGs with nine vertices, which were unknown. We prove that there are exactly 1494 minimal non-PCGs with nine vertices and provide evidence for each of them.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Azam NA, Ito M, Shurbevski A, Nagamochi H (2018) Enumerating all pairwise compatibility graphs with a given number of vertices based on linear programming. In: 2nd international workshop on enumeration problems and applications (WEPA), paper 6c
Azam NA, Chiewvanichakorn R, Zhang F, Shurbevski A, Nagamochi H, Akutsu T (2020a) A method for the inverse QSAR/QSPR based on artificial neural networks and mixed integer linear programming with guaranteed admissibility. In: Proceedings of the 13th international joint conference on biomedical engineering systems and technologies—Volume 3: BIOINFORMATICS
Azam NA, Shurbevski A, Nagamochi H (2020b) An efficient algorithm to count tree-like graphs with a given number of vertices and self-loops. Entropy 22(9):923
Azam NA, Shurbevski A, Nagamochi H (2020c) Enumerating tree-like graphs and polymer topologies with a given cycle rank. Entropy 22(11):1295
Azam NA, Shurbevski A, Nagamochi H (2020d) A method for enumerating pairwise compatibility graphs with a given number of vertices. Discret Appl Math. https://doi.org/10.1016/j.dam.2020.08.016
Azam NA, Shurbevski A, Nagamochi H (2020e) On the enumeration of minimal non-pairwise compatibility graphs. In: International computing and combinatorics conference, pp 372–383. Springer
Baiocchi P, Calamoneri T, Monti A, Petreschi R (2019) Some classes of graphs that are not PCGs. Theor Comput Sci 791:62–75
Calamoneri T, Sinaimeri B (2016) Pairwise compatibility graphs: a survey. SIAM Rev 58(3):445–460
Calamoneri T, Frascaria D, Sinaimeri B (2013a) All graphs with at most seven vertices are pairwise compatibility graphs. Comput J 56(7):882–886
Calamoneri T, Montefusco E, Petreschi R, Sinaimeri B (2013b) Exploring pairwise compatibility graphs. Theor Comput Sci 468:23–36
Calamoneri T, Frangioni A, Sinaimeri B (2014) Pairwise compatibility graphs of caterpillars. Comput J 57(11):1616–1623
Durocher S, Mondal D, Rahman MS (2015) On graphs that are not PCGs. Theor Comput Sci 571:78–87
Gale D (1989) The theory of linear economic models. University of Chicago Press, Chicago
Gugisch R, Kerber A, Kohnert A, Laue R, Meringer M, Rücker C, Wassermann A (2015) MOLGEN 5.0, a molecular structure generator. In: Advances in mathematical chemistry and applications, pp 113–138. Elsevier
http://users.cecs.anu.edu.au/~bdm/data/graphs.html (visited on June, 2019)
Ito R, Azam NA, Wang C, Shurbevski A, Nagamochi H, Akutsu T (2021) A novel method for the inverse QSAR/QSPR to monocyclic chemical compounds based on artificial neural networks and integer programming. In: Arabnia HR, Deligiannidis L, Shouno H, Tinetti FG, Tran QN (eds) Advances in computer vision and computational biology. Transactions on computational science and computational intelligence. Springer, Cham. https://doi.org/10.1007/978-3-030-71051-4_51
Kearney P, Munro JI, Phillips D (2003) Efficient generation of uniform samples from phylogenetic trees. In: International workshop on algorithms in bioinformatics, pp 177–189. Springer
McKay BD, Piperno A (2014) Practical graph isomorphism, II. J Symb Comput 60:94–112
Peironcely JE, Rojas-Chertó M, Fichera D, Reijmers T, Coulier L, Faulon J-L, Hankemeier T (2012) OMG: open molecule generator. J Cheminf 4(1):21
Suzuki M, Nagamochi H, Akutsu T (2014) Efficient enumeration of monocyclic chemical graphs with given path frequencies. J Cheminf 6(1):31
Xiao M, Nagamochi H (2020) Some reduction operations to pairwise compatibility graphs. Inf Process Lett 153:105875
Yanhaona MN, Bayzid MS, Rahman MS (2010) Discovering pairwise compatibility graphs. Discrete Math Algorithms Appl 2(04):607–623
Acknowledgements
This research is partially supported by JSPS KAKENHI Grant No. 18J23484.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
A preliminary version of this article appeared in COCOON 2020 (Azam et al. 2020e).
Rights and permissions
About this article
Cite this article
Azam, N.A., Shurbevski, A. & Nagamochi, H. On the enumeration of minimal non-pairwise compatibility graphs. J Comb Optim 44, 2871–2892 (2022). https://doi.org/10.1007/s10878-021-00799-x
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-021-00799-x