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

Super Rk-vertex-connectedness

Author

Listed:
  • Hu, Xiaomin
  • Tian, Yingzhi
  • Meng, Jixiang

Abstract

For a graph G=(V,E), a subset F ⊆ V(G) is called an Rk-vertex-cut of G if G−F is disconnected and each vertex u∈V(G)−F has at least k neighbours in G−F. The Rk-vertex-connectivity of G, denoted by κk(G), is the cardinality of a minimum Rk-vertex-cut of G. In this paper, we further study the Rk-vertex-connectivity by introducing the concept, called super Rk-vertex-connectedness. The graph G is called super Rk-vertex-connectedness if, for every minimum Rk-vertex-cut S, G−S contains a component which is isomorphic to a certain graph H, where H is related to the graph G and integer k. For the Cayley graphs generated by wheel graphs, H is isomorphic to K2 when k=1 and H is isomorphic to C4 when k=2. In this paper, we show that the Cayley graphs generated by wheel graphs are super R1-vertex-connectedness and super R2-vertex-connectedness. Our studies generalize the main result in [8].

Suggested Citation

  • Hu, Xiaomin & Tian, Yingzhi & Meng, Jixiang, 2018. "Super Rk-vertex-connectedness," Applied Mathematics and Computation, Elsevier, vol. 339(C), pages 812-819.
    • Handle: RePEc:eee:apmaco:v:339:y:2018:i:c:p:812-819
    DOI: 10.1016/j.amc.2018.07.012
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300318305708
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2018.07.012?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. Tu, Jianhua & Zhou, Yukang & Su, Guifu, 2017. "A kind of conditional connectivity of Cayley graphs generated by wheel graphs," Applied Mathematics and Computation, Elsevier, vol. 301(C), pages 177-186.
    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. Wei, Yulong & Xu, Min, 2018. "The 1, 2-good-neighbor conditional diagnosabilities of regular graphs," Applied Mathematics and Computation, Elsevier, vol. 334(C), pages 295-310.
    2. Yu Yang & Long Li & Wenhu Wang & Hua Wang, 2020. "On BC-Subtrees in Multi-Fan and Multi-Wheel Graphs," Mathematics, MDPI, vol. 9(1), pages 1-29, December.

    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:339:y:2018:i:c:p:812-819. 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.