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

Path connectivity of line graphs and total graphs of complete bipartite graphs

Author

Listed:
  • Zhu, Wen-Han
  • Hao, Rong-Xia
  • Feng, Yan-Quan
  • Lee, Jaeun

Abstract

Let θ be a subset of vertex set V(G) of a simply connected graph G, two θ-trees P1 and P2 of G are said to be internally disjoint if V(P1)∩V(P2)=θ and E(P1)∩E(P2)=∅. For an integer k≥2, the k-path connectivity πk(G) (resp. k-tree connectivity κk(G)) of a graph G is defined as min{πG(θ)|θ⊆V(G)and|θ|=k} (resp. min{κG(θ)|θ⊆V(G)and|θ|=k}), where πG(θ) (resp. κG(θ)) is the maximum number of pairwise internally disjoint θ-paths (resp. θ-trees) in G. The 3-tree connectivity of the line graph L(Km,n) and total graph T(Km,n) of the complete bipartite graph Km,n are gotten in [Appl. Math. Comput. 347(2019) 645-652]. In this paper, these results are improved from trees to paths. The exact values of the 3-path connectivity for L(Km,n) and T(Km,n) are gotten. That is, π3(L(Km,n))=⌊3m+2n−34⌋−1 for m=3 and odd n, otherwise, π3(L(Km,n))=⌊3m+2n−34⌋ unless m=1 and n=1,2; π3(T(Km,n))=m+⌊m4⌋ for n≥m≥1. In addition, the compact upper bound of π3(G) for a general graph G are gotten.

Suggested Citation

  • Zhu, Wen-Han & Hao, Rong-Xia & Feng, Yan-Quan & Lee, Jaeun, 2023. "Path connectivity of line graphs and total graphs of complete bipartite graphs," Applied Mathematics and Computation, Elsevier, vol. 457(C).
    • Handle: RePEc:eee:apmaco:v:457:y:2023:i:c:s009630032300351x
    DOI: 10.1016/j.amc.2023.128182
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S009630032300351X
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2023.128182?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:457:y:2023:i:c:s009630032300351x. 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.