internally disjoint trees
Recently Published Documents


TOTAL DOCUMENTS

3
(FIVE YEARS 0)

H-INDEX

0
(FIVE YEARS 0)

2019 ◽  
Vol 30 (05) ◽  
pp. 793-809
Author(s):  
Shu-Li Zhao ◽  
Rong-Xia Hao

The connectivity plays an important role in measuring the fault tolerance and reliability of interconnection networks. The generalized [Formula: see text]-connectivity of a graph [Formula: see text], denoted by [Formula: see text], is an important indicator of a network’s ability for fault tolerance and reliability. The bubble-sort star graph, denoted by [Formula: see text], is a well known interconnection network. In this paper, we show that [Formula: see text] for [Formula: see text], that is, for any three vertices in [Formula: see text], there exist [Formula: see text] internally disjoint trees connecting them in [Formula: see text] for [Formula: see text], which attains the upper bound of [Formula: see text] given by Li et al. for [Formula: see text].


2018 ◽  
Vol 12 (2) ◽  
pp. 297-317
Author(s):  
Encarnación Abajo ◽  
Rocío Casablanca ◽  
Ana Diánez ◽  
Pedro García-Vázquez

Let G be a connected graph with n vertices and let k be an integer such that 2 ? k ? n. The generalized connectivity kk(G) of G is the greatest positive integer l for which G contains at least l internally disjoint trees connecting S for any set S ? V (G) of k vertices. We focus on the generalized connectivity of the strong product G1 _ G2 of connected graphs G1 and G2 with at least three vertices and girth at least five, and we prove the sharp bound k3(G1 _ G2) ? k3(G1)_3(G2) + k3(G1) + k3(G2)-1.


2012 ◽  
Vol Vol. 14 no. 1 (Graph Theory) ◽  
Author(s):  
Hengzhe Li ◽  
Xueliang Li ◽  
Yuefang Sun

Graph Theory International audience The generalized connectivity of a graph, which was introduced by Chartrand et al. in 1984, is a generalization of the concept of vertex connectivity. Let S be a nonempty set of vertices of G, a collection \T-1, T (2), ... , T-r\ of trees in G is said to be internally disjoint trees connecting S if E(T-i) boolean AND E(T-j) - empty set and V (T-i) boolean AND V(T-j) = S for any pair of distinct integers i, j, where 1 <= i, j <= r. For an integer k with 2 <= k <= n, the k-connectivity kappa(k) (G) of G is the greatest positive integer r for which G contains at least r internally disjoint trees connecting S for any set S of k vertices of G. Obviously, kappa(2)(G) = kappa(G) is the connectivity of G. Sabidussi's Theorem showed that kappa(G square H) >= kappa(G) + kappa(H) for any two connected graphs G and H. In this paper, we prove that for any two connected graphs G and H with kappa(3) (G) >= kappa(3) (H), if kappa(G) > kappa(3) (G), then kappa(3) (G square H) >= kappa(3) (G) + kappa(3) (H); if kappa(G) = kappa(3)(G), then kappa(3)(G square H) >= kappa(3)(G) + kappa(3) (H) - 1. Our result could be seen as an extension of Sabidussi's Theorem. Moreover, all the bounds are sharp.


Sign in / Sign up

Export Citation Format

Share Document