The superconnectivity of large digraphs and graphs
type: Item
instance of: scholarly article
title: The superconnectivity of large digraphs and graphs
zbMATH Open document ID: 0791.05068
DOI: 10.1016/0012-365X(92)00051-R
author: V. Pereyra
published in: Discrete Mathematics
publication date: 1994-03-01T00:00:00Z
review text: First of all the author gives basic notions and an overview of actual results. The digraph \(D\) is said to be super-\(\kappa\) (vertex connectivity) if all its minimum disconnecting sets are trivial. Analogously, \(D\) is called super-\(\lambda\) (edge connectivity) if all its minimum edge-disconnecting sets are trivial. The author's main results are sufficient conditions for a digraph \(D\) to be super-\(\kappa\) or super-\(\lambda\). Moreover, the author gives several interesting corollaries of these theorems.
Mathematics Subject Classification ID: 05C40
Mathematics Subject Classification ID: 05C20
zbMATH DE Number: 500608
zbMATH Keywords: superconnectivity
zbMATH Keywords: vertex connectivity
zbMATH Keywords: edge connectivity
zbMATH Keywords: digraph
reviewed by: Ferdinand Gliviak
MaRDI profile type: Publication
cites work: On the linegraph of a directed-graph
cites work: Large fault-tolerant interconnection networks
cites work: Connectivity of Kautz networks
cites work: Synthesis of reliable networks - a survey
cites work: Q3818315
cites work: Lower-bounds on the connectivities of a graph
cites work: Maximally connected digraphs
cites work: Q3490021
cites work: The connectivity of large digraphs and graphs
cites work: Q3490015
cites work: Line Digraph Iterations and the (d, k) Digraph Problem
cites work: Connectivity of Regular Directed Graphs with Small Diameters
cites work: Q5629652
cites work: Super edge-connectivity of dense digraphs and graphs
cites work: Sufficient conditions for maximally connected dense graphs
description: scientific article; zbMATH DE number 500608