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

Strong edge chromatic index of the generalized Petersen graphs

Author

Listed:
  • Yang, Zixuan
  • Wu, Baoyindureng

Abstract

A strong edge coloring of a graph G is an assignment of colors to the edges of G such that two distinct edges are colored differently if they are adjacent to a common edge or share an endpoint. The strong chromatic index of a graph G, denoted by χs′(G), is the minimum number of colors needed for a strong edge coloring of G. We determine the strong chromatic index of the generalized Petersen graphs P(n, k) when 1 ≤ k ≤ 3.

Suggested Citation

  • Yang, Zixuan & Wu, Baoyindureng, 2018. "Strong edge chromatic index of the generalized Petersen graphs," Applied Mathematics and Computation, Elsevier, vol. 321(C), pages 431-441.
    • Handle: RePEc:eee:apmaco:v:321:y:2018:i:c:p:431-441
    DOI: 10.1016/j.amc.2017.10.047
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300317307464
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2017.10.047?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. Enqiang Zhu & Zepeng Li & Zehui Shao & Jin Xu & Chanjuan Liu, 2016. "Acyclic 3-coloring of generalized Petersen graphs," Journal of Combinatorial Optimization, Springer, vol. 31(2), pages 902-911, February.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Lily Chen & Shumei Chen & Ren Zhao & Xiangqian Zhou, 2020. "The strong chromatic index of graphs with edge weight eight," Journal of Combinatorial Optimization, Springer, vol. 40(1), pages 227-233, July.
    2. Ming Chen & Lianying Miao & Shan Zhou, 2020. "Strong Edge Coloring of Generalized Petersen Graphs," Mathematics, MDPI, vol. 8(8), pages 1-12, August.
    3. David G. L. Wang & Monica M. Y. Wang & Shiqiang Zhang, 2022. "Determining the edge metric dimension of the generalized Petersen graph P(n, 3)," Journal of Combinatorial Optimization, Springer, vol. 43(2), pages 460-496, March.

    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:321:y:2018:i:c:p:431-441. 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.