zbMATH — the first resource for mathematics

Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
On super and restricted connectivity of some interconnection networks. (English) Zbl 1240.05177
Summary: The super connectivity (super edge-connectivity) of a connected graph is the minimum cardinality of a vertex-cut (edge-cut) whose removal does not isolate a vertex. In this paper we consider the two parameters for a special class of graphs $G(G_0,G_1;M)$, proposed by Chen et al. [{\it Y.-C. Chen}, {\it J.J.M. Tan}, {\it L.-H. Hsu}, and {\it S.-S. Kao}, “Super-connectivity and super-edge-connectivity for some interconnection networks,” Appl. Math. Comput. 140, No. 2--3, 245--254 (2003; Zbl 1025.05037)], obtained from two $k$-regular $k$-connected graphs $G_0$ and $G_1$ with the same order by adding a perfect matching between their vertices. Our results improve those of Chen et al. [loc.cit.]. As applications, the super connectivity and the super edge-connectivity of the $n$-dimensional hypercube, twisted cube, cross cube, Möbius cube and locally twisted cube are all $2n-2$.

94C15Applications of graph theory to circuits and networks