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

The conflict-free connection number and the minimum degree-sum of graphs

Author

Listed:
  • Doan, Trung Duy
  • Do, Thi Thanh Chau
  • Ha, Pham Hoang
  • Pham, Ngoc Diep
  • Schiermeyer, Ingo

Abstract

In the context of an edge-coloured graph G, a path within the graph is deemed conflict-free when a colour is exclusively applied to one of its edges. The presence of a conflict-free path connecting any two unique vertices of an edge-coloured graph is what defines it as conflict-free connected. The conflict-free connection number, indicated by cfc(G), is the fewest number of colours necessary to make G conflict-free connected. Consider the subgraph C(G) of a connected graph G, which is constructed from the cut-edges of G. Let σ3(G) be the minimum degree-sum of any 3 independent vertices in G. In this study, we establish that for a connected graph G with an order of n≥8 and σ3(G)≥n−1, the following conditions hold: (1) cfc(G)=3 when C(G)≅K1,3; (2) cfc(G)=2 when C(G) forms a linear forest. Moreover, we will now demonstrate that if G is a connected, non-complete graph with n vertices, where n≥43, C(G) is a linear forest, δ(G)≥3, and σ3(G)≥3n−145, then cfc(G)=2. Moreover, we also determine the upper bound of the number of cut-edges of a connected graph depending on the degree-sum of any three independent vertices.

Suggested Citation

  • Doan, Trung Duy & Do, Thi Thanh Chau & Ha, Pham Hoang & Pham, Ngoc Diep & Schiermeyer, Ingo, 2024. "The conflict-free connection number and the minimum degree-sum of graphs," Applied Mathematics and Computation, Elsevier, vol. 482(C).
    • Handle: RePEc:eee:apmaco:v:482:y:2024:i:c:s0096300324004429
    DOI: 10.1016/j.amc.2024.128981
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300324004429
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2024.128981?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. Hong Chang & Meng Ji & Xueliang Li & Jingshu Zhang, 2021. "Conflict-free connection of trees," Journal of Combinatorial Optimization, Springer, vol. 42(3), pages 340-353, October.
    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.

      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:482:y:2024:i:c:s0096300324004429. 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.