Skip to main content
SpringerLink
Log in

On the Enumeration of Minimal Non-pairwise Compatibility Graphs

  • Conference paper
  • First Online:
Book cover Computing and Combinatorics (COCOON 2020)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 12273))

Included in the following conference series:

Abstract

A graph is a pairwise compatibility graph (PCG) if it can be represented by an edge weighted tree whose set of leaves is the set of vertices of the graph, and there is an edge between two vertices in the graph if and only if the distance between them in the tree is within a given interval. Enumerating all minimal non-PCGs (each of whose induced subgraphs is a PCG) with a given number of vertices is a challenging task, since it involves a large number of “configurations” that need to be inspected, an infinite search space of weights, and the construction of finite size evidence that a graph is not a PCG. We handle the problem of a large number of configurations by first screening graphs that are PCGs by using a heuristic PCG generator, and then constructing configurations that show some graphs to be PCGs. Finally, we generated configurations by excluding those configurations which cannot be used to show that a given graph is a PCG. To deal with the difficulty of infinite search space and construction of finite size evidence, we use linear programming (LP) formulations whose solutions serve as finite size evidence. We enumerated all minimal non-PCGs with nine vertices, the smallest integer for which minimal non-PCGs are unknown. We prove that there are exactly 1,494 minimal non-PCGs with nine vertices and provide evidence for each of them.

Partially supported by JSPS KAKENHI Grant no. 18J23484.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Azam, N.A., Ito, M., Shurbevski, A., Nagamochi, H.: 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 (2018)

    Google Scholar 

  2. Azam, N.A., Shurbevski, A., Nagamochi, H.: A method for enumerating all pairwise compatibility graphs with a given number of vertices. Discrete Appl. Math. (To appear)

    Google Scholar 

  3. Baiocchi, P., Calamoneri, T., Monti, A., Petreschi, R.: Some classes of graphs that are not PCGs. Theor. Comput. Sci. 791, 62–75 (2019). https://doi.org/10.1016/j.tcs.2019.05.017

    Article  MathSciNet  MATH  Google Scholar 

  4. Calamoneri, T., Frangioni, A., Sinaimeri, B.: Pairwise compatibility graphs of caterpillars. Comput. J. 57(11), 1616–1623 (2014)

    Article  Google Scholar 

  5. Calamoneri, T., Frascaria, D., Sinaimeri, B.: All graphs with at most seven vertices are pairwise compatibility graphs. Comput. J. 56(7), 882–886 (2013)

    Article  Google Scholar 

  6. Calamoneri, T., Montefusco, E., Petreschi, R., Sinaimeri, B.: Exploring pairwise compatibility graphs. Theor. Comput. Sci. 468, 23–36 (2013)

    Article  MathSciNet  Google Scholar 

  7. Calamoneri, T., Sinaimeri, B.: Pairwise compatibility graphs: a survey. SIAM Rev. 58(3), 445–460 (2016)

    Article  MathSciNet  Google Scholar 

  8. Durocher, S., Mondal, D., Rahman, M.S.: On graphs that are not PCGs. Theor. Comput. Sci. 571, 78–87 (2015)

    Article  MathSciNet  Google Scholar 

  9. Gale, D.: The Theory of Linear Economic Models. University of Chicago Press, Chicago (1989)

    MATH  Google Scholar 

  10. Kearney, P., Munro, J.I., Phillips, D.: Efficient generation of uniform samples from phylogenetic trees. In: Benson, G., Page, R.D.M. (eds.) WABI 2003. LNCS, vol. 2812, pp. 177–189. Springer, Heidelberg (2003). https://doi.org/10.1007/978-3-540-39763-2_14

    Chapter  Google Scholar 

  11. McKay, B.D., Piperno, A.: Practical graph isomorphism, II. J. Symbolic Comput. 60, 94–112 (2014)

    Article  MathSciNet  Google Scholar 

  12. http://users.cecs.anu.edu.au/~bdm/data/graphs.html. Accessed June 2019

  13. Xiao, M., Nagamochi, H.: Some reduction operations to pairwise compatibility graphs. Inf. Process. Lett. 153, 105875 (2020). https://doi.org/10.1016/j.ipl.2019.105875

    Article  MathSciNet  MATH  Google Scholar 

  14. Yanhaona, M.N., Bayzid, M.S., Rahman, M.S.: Discovering pairwise compatibility graphs. Discrete Math. Algorithms Appl. 2(04), 607–623 (2010)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Applied Mathematics, Kyoto University, Kyoto, Japan

    Naveed Ahmed Azam, Aleksandar Shurbevski & Hiroshi Nagamochi

Authors
  1. Naveed Ahmed Azam
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Aleksandar Shurbevski
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Hiroshi Nagamochi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Naveed Ahmed Azam .

Editor information

Editors and Affiliations

  1. Georgia State University, Atlanta, USA

    Donghyun Kim

  2. Department of Mathematics and Physics, North Carolina Central University, Durham, NC, USA

    R. N. Uma

  3. Computer Science, Georgia State University, Atlanta, GA, USA

    Zhipeng Cai

  4. Korea University, Seoul, Korea (Republic of)

    Dong Hoon Lee

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Azam, N.A., Shurbevski, A., Nagamochi, H. (2020). On the Enumeration of Minimal Non-pairwise Compatibility Graphs. In: Kim, D., Uma, R., Cai, Z., Lee, D. (eds) Computing and Combinatorics. COCOON 2020. Lecture Notes in Computer Science(), vol 12273. Springer, Cham. https://doi.org/10.1007/978-3-030-58150-3_30

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-58150-3_30

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-58149-7

  • Online ISBN: 978-3-030-58150-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation