Two kinds of generalized connectivity of dual cubes

Let S⊆V(G) and κG(S) denote the maximum number k of edge-disjoint trees T1,T2,…,Tk in G such that V(Ti)⋂V(Tj)=S for any i,j∈{1,2,…,k} and i≠j. For an integer r with 2≤r≤n, the generalizedr-connectivity of a graph G is defined as κr(G)=min{κG(S)|S⊆V(G) and |S|=r}. The r-component connectivity cκr(G)...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Discrete Applied Mathematics 2019-03, Vol.257, p.306-316
Hauptverfasser:	Zhao, Shu-Li, Hao, Rong-Xia, Cheng, Eddie
Format:	Artikel
Sprache:	eng
Schlagworte:	Apexes Component connectivity Connectivity Cubes Deletion Dual cube Fault-tolerance Generalized connectivity Graph theory Hypercubes Trees (mathematics)
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!