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

Near packings with restriction on degrees in graphs

Author

Listed:
  • Yang, Qian
  • Gao, Yunshu

Abstract

In graph theory, a packing within graph G is defined as a collection H={H1,H2}, where H1 and H2 are both equivalent to G, yet they exist as edge-disjoint subgraphs within Kn. Considering a positive integer k, we introduce Dk, a set comprising graphs within G, each with a maximum degree not exceeding k. Extending the concept of a packing, a near packing that accommodates Dk in graph G emerges, realized by overlapping two iterations of G. In this configuration, the intersecting subgraph formed by edges shared in both G copies is a member of Dk. The notation m(n,Dk) represents the highest possible value of m, ensuring each graph with order n and size at most m can incorporate a near packing that accommodates Dk. A notable case is m(n,D0)=n−2, highlighting that a near packing which admits D0 equates to a standard packing. This paper focuses on establishing the value of m(n,D1)=⌊3n−52⌋.

Suggested Citation

  • Yang, Qian & Gao, Yunshu, 2024. "Near packings with restriction on degrees in graphs," Applied Mathematics and Computation, Elsevier, vol. 477(C).
    • Handle: RePEc:eee:apmaco:v:477:y:2024:i:c:s0096300324002893
    DOI: 10.1016/j.amc.2024.128828
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300324002893
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2024.128828?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.

    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:477:y:2024:i:c:s0096300324002893. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.