The λ3-connectivity and κ3-connectivity of recursive circulants

Hengzhe Li and Jiajia Wang

Applied Mathematics and Computation, 2018, vol. 339, issue C, 750-757

Abstract: Let S be a set of at least two vertices in a graph G. A subtree T of G is a S-Steiner tree if S ⊆ V (T). Two S-Steiner trees T1 and T2 are edge-disjoint (resp. internally disjoint) if E(T1)∩E(T2)=∅ (resp. E(T1)∩E(T2)=∅ and V(T1)∩V(T2)=S). Let λG(S) (resp. κG(S)) be the maximum number of edge-disjoint (resp. internally disjoint) S-Steiner trees in G, and let λk(G) (κk(G)) be the minimum λG(S) (resp. κG(S)) for S ranges over all k-subsets of V(G). Clearly, λ2(G) (resp. κ2(G)) is the classical edge-connectivity λ(G) (resp. connectivity κ(G)). In this paper, we study the λ3-connectivity and κ3-connectivity of a recursive circulant G, determine λ3(G)=δ(G)−1 for each recursive circulant G, and κ3(G)=δ(G)−1 for each recursive circulant G except G≅G(2m, 2).

Keywords: Recursive circulant; λ3-connectivity; κ3-edge-connectivity (search for similar items in EconPapers)
Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300318306313
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:339:y:2018:i:c:p:750-757

DOI: 10.1016/j.amc.2018.07.065

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().