DocumentCode
145156
Title
Generalized edge-connectivity of (n, k)-star graphs
Author
Yunchao Wei ; Minghua Liu
Author_Institution
Coll. of Inf. Technol., Shanghai Ocean Univ., Shanghai, China
Volume
1
fYear
2014
fDate
26-28 April 2014
Firstpage
278
Lastpage
282
Abstract
An edge subset B is h-super edge-cut of a connected graph G if G - B is disconnected, moreover every vertex has at least h neighbors in G - B. Minimum |B| of G is h-super edge-connectivity of G, denoted by λs(H) (G). In this paper, we determine λs(H)(Sn, k) for 0 ≤ h ≤ n - k, where Sn, k de-notes (n, k)-star graphs, so that we can get traditional edge-connectivity λ (Sn, k) and λs(Sn, k) and get edge-connectivity of n-star graphs Sn who is isomorphic to Sn, n-1. In fact, the conclusions of generalized edge-connectivity in the known graphs are few, so this work is very valuable.
Keywords
graph theory; (n,k)-star graphs; connected graph; edge subset; generalized edge-connectivity; h-super edge-connectivity; h-super edge-cut; (n; Combinatorics; Generalized edge-connectivity; k)-star graph;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Science, Electronics and Electrical Engineering (ISEEE), 2014 International Conference on
Conference_Location
Sapporo
Print_ISBN
978-1-4799-3196-5
Type
conf
DOI
10.1109/InfoSEEE.2014.6948114
Filename
6948114
Link To Document