IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v411y2021ics0096300321005610.html
   My bibliography  Save this article

On the intersection graph of the disks with diameters the sides of a convex n-gon

Author

Listed:
  • Herrera, Luis H.
  • Pérez-Lantero, Pablo

Abstract

Given a convex n-gon, we can draw n disks (called side disks) where each disk has a different side of the polygon as diameter and the midpoint of the side as its center. The intersection graph of such disks is the undirected graph with vertices the n disks and two disks are adjacent if and only if they have a point in common. Such a graph was introduced by Huemer and Pérez-Lantero (Discrete Mathematics, 2020), proved to be planar and Hamiltonian. In this paper, we study further combinatorial properties of this graph. We prove that the treewidth is at most 3, by showing an O(n)-time algorithm that builds a tree decomposition of width at most 3, given the polygon as input. This implies that we can construct the intersection graph of the side disks in O(n) time. We further study the independence number, which is the maximum number of pairwise disjoint disks. The planarity condition implies that for every convex n-gon we can select at least ⌈n/4⌉ pairwise disjoint disks, and we prove that for every n≥3 there exist convex n-gons in which we cannot select more than this number. Finally, we show that our class of graphs includes all outerplanar Hamiltonian graphs except the cycle of length four, and that it is a proper subclass of the planar Hamiltonian graphs.

Suggested Citation

  • Herrera, Luis H. & Pérez-Lantero, Pablo, 2021. "On the intersection graph of the disks with diameters the sides of a convex n-gon," Applied Mathematics and Computation, Elsevier, vol. 411(C).
    • Handle: RePEc:eee:apmaco:v:411:y:2021:i:c:s0096300321005610
    DOI: 10.1016/j.amc.2021.126472
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300321005610
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2021.126472?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Wan, Pengfei & Tu, Jianhua & Zhang, Shenggui & Li, Binlong, 2018. "Computing the numbers of independent sets and matchings of all sizes for graphs with bounded treewidth," Applied Mathematics and Computation, Elsevier, vol. 332(C), pages 42-47.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Wenwen Tian & Fei Zhao & Zheng Sun & Xuesong Mei & Guangde Chen, 2019. "Orderings of a class of trees with respect to the Merrifield–Simmons index and the Hosoya index," Journal of Combinatorial Optimization, Springer, vol. 38(4), pages 1286-1295, November.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:apmaco:v:411:y:2021:i:c:s0096300321005610. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.