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

The generalized 3-connectivity of the Mycielskian of a graph

Author

Listed:
  • Li, Shasha
  • Zhao, Yan
  • Li, Fengwei
  • Gu, Ruijuan

Abstract

The generalized k-connectivity κk(G) of a graph G is a generalization of the concept of the traditional connectivity, which can serve for measuring the capability of a graph G to connect any k vertices in G. In a search for triangle-free graphs with arbitrarily large chromatic numbers, Mycielski developed a graph transformation that transforms a graph G into a new graph μ(G), which is called the Mycielskian of G. In this paper, we investigate the relation between the generalized 3-connectivity of the Mycielskian of a graph G and the generalized 3-connectivity of G, and show that κ3(μ(G))≥κ3(G)+1. Moreover, by this result, we completely determine the generalized 3-connectivity of the Mycielskian of the tree Tn, the complete graph Kn and the complete bipartite graph Ka,b.

Suggested Citation

  • Li, Shasha & Zhao, Yan & Li, Fengwei & Gu, Ruijuan, 2019. "The generalized 3-connectivity of the Mycielskian of a graph," Applied Mathematics and Computation, Elsevier, vol. 347(C), pages 882-890.
    • Handle: RePEc:eee:apmaco:v:347:y:2019:i:c:p:882-890
    DOI: 10.1016/j.amc.2018.11.006
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300318309792
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2018.11.006?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. Shasha Li & Xueliang Li, 2012. "Note on the hardness of generalized connectivity," Journal of Combinatorial Optimization, Springer, vol. 24(3), pages 389-396, October.
    2. Li, Shasha & Tu, Jianhua & Yu, Chenyan, 2016. "The generalized 3-connectivity of star graphs and bubble-sort graphs," Applied Mathematics and Computation, Elsevier, vol. 274(C), pages 41-46.
    3. Hui Lei & Shasha Li & Henry Liu & Yongtang Shi, 2018. "Rainbow vertex connection of digraphs," Journal of Combinatorial Optimization, Springer, vol. 35(1), pages 86-107, January.
    4. Yongtang Shi & Meiqin Wei & Jun Yue & Yan Zhao, 2017. "Coupon coloring of some special graphs," Journal of Combinatorial Optimization, Springer, vol. 33(1), pages 156-164, January.
    5. Li, Hengzhe & Ma, Yingbin & Yang, Weihua & Wang, Yifei, 2017. "The generalized 3-connectivity of graph products," Applied Mathematics and Computation, Elsevier, vol. 295(C), pages 77-83.
    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. Nigus Demelash Melaku & Ali Fares & Ripendra Awal, 2023. "Exploring the Impact of Winter Storm Uri on Power Outage, Air Quality, and Water Systems in Texas, USA," Sustainability, MDPI, vol. 15(5), pages 1-19, February.
    2. Zhu, Wen-Han & Hao, Rong-Xia & Feng, Yan-Quan & Lee, Jaeun, 2023. "The 3-path-connectivity of the k-ary n-cube," Applied Mathematics and Computation, Elsevier, vol. 436(C).

    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. Zhao, Shu-Li & Hao, Rong-Xia & Wei, Chao, 2022. "Internally disjoint trees in the line graph and total graph of the complete bipartite graph," Applied Mathematics and Computation, Elsevier, vol. 422(C).
    2. Gao, Hui & Lv, Benjian & Wang, Kaishun, 2018. "Two lower bounds for generalized 3-connectivity of Cartesian product graphs," Applied Mathematics and Computation, Elsevier, vol. 338(C), pages 305-313.
    3. Li, Hengzhe & Wang, Jiajia, 2018. "The λ3-connectivity and κ3-connectivity of recursive circulants," Applied Mathematics and Computation, Elsevier, vol. 339(C), pages 750-757.
    4. Zhao, Shu-Li & Hao, Rong-Xia, 2019. "The generalized 4-connectivity of exchanged hypercubes," Applied Mathematics and Computation, Elsevier, vol. 347(C), pages 342-353.
    5. Li, Hengzhe & Ma, Yingbin & Yang, Weihua & Wang, Yifei, 2017. "The generalized 3-connectivity of graph products," Applied Mathematics and Computation, Elsevier, vol. 295(C), pages 77-83.
    6. Gao, Zhipeng & Lei, Hui & Wang, Kui, 2020. "Rainbow domination numbers of generalized Petersen graphs," Applied Mathematics and Computation, Elsevier, vol. 382(C).
    7. Li, Yinkui & Wei, Liqun, 2023. "Note for the conjecture on the generalized 4-connectivity of total graphs of the complete bipartite graph," Applied Mathematics and Computation, Elsevier, vol. 458(C).
    8. Hong Chang & Xueliang Li & Colton Magnant & Zhongmei Qin, 2018. "The $$(k,\ell )$$ ( k , ℓ ) -proper index of graphs," Journal of Combinatorial Optimization, Springer, vol. 36(2), pages 458-471, August.
    9. Nie, Kairui & Ma, Yingbin & Sidorowicz, Elżbieta, 2023. "(Strong) Proper vertex connection of some digraphs," Applied Mathematics and Computation, Elsevier, vol. 458(C).
    10. Fiedorowicz, Anna & Sidorowicz, Elżbieta & Sopena, Éric, 2021. "Proper connection and proper-walk connection of digraphs," Applied Mathematics and Computation, Elsevier, vol. 410(C).
    11. Catanzaro, Daniele & Frohn, Martin & Gascuel, Olivier & Pesenti, Raffaele, 2023. "A Massively Parallel Exact Solution Algorithm for the Balanced Minimum Evolution Problem," LIDAM Discussion Papers CORE 2023001, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    12. Catanzaro, Daniele & Frohn, Martin & Gascuel, Olivier & Pesenti, Raffaele, 2021. "A Tutorial on the Balanced Minimum Evolution Problem," LIDAM Discussion Papers CORE 20210, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    13. Zhu, Wen-Han & Hao, Rong-Xia & Feng, Yan-Quan & Lee, Jaeun, 2023. "The 3-path-connectivity of the k-ary n-cube," Applied Mathematics and Computation, Elsevier, vol. 436(C).
    14. Zhang, Guozhen & Wang, Dajin, 2019. "Structure connectivity and substructure connectivity of bubble-sort star graph networks," Applied Mathematics and Computation, Elsevier, vol. 363(C), pages 1-1.
    15. Lily Chen & Xueliang Li & Mengmeng Liu & Yaping Mao, 2017. "A solution to a conjecture on the generalized connectivity of graphs," Journal of Combinatorial Optimization, Springer, vol. 33(1), pages 275-282, January.
    16. Gu, Ran & Deng, Bo & Li, Rui, 2019. "Note on directed proper connection number of a random graph," Applied Mathematics and Computation, Elsevier, vol. 361(C), pages 169-174.
    17. Hongyu Liang & Tiancheng Lou & Haisheng Tan & Yuexuan Wang & Dongxiao Yu, 2015. "On the complexity of connectivity in cognitive radio networks through spectrum assignment," Journal of Combinatorial Optimization, Springer, vol. 29(2), pages 472-487, February.
    18. Banerjee, S. & Henning, Michael A. & Pradhan, D., 2021. "Perfect Italian domination in cographs," Applied Mathematics and Computation, Elsevier, vol. 391(C).
    19. Catanzaro, Daniele & Frohn, Martin & Pesenti, Raffaele, 2021. "A Massively Parallel Exact Solution Algorithm for the Balanced Minimum Evolution Problem," LIDAM Discussion Papers CORE 2021023, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    20. Ma, Yuede & Cai, Qingqiong & Yao, Shunyu, 2019. "Integer linear programming models for the weighted total domination problem," Applied Mathematics and Computation, Elsevier, vol. 358(C), pages 146-150.

    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:347:y:2019:i:c:p:882-890. 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.