Super edge-connectivity of dense digraphs and graphs
type: Item
instance of: scholarly article
title: Super edge-connectivity of dense digraphs and graphs
zbMATH Open document ID: 0760.05050
DOI: 10.1016/0166-218X(92)90155-4
author: Terunao Soneoka
published in: Discrete Applied Mathematics
publication date: 1993-01-16T00:00:00Z
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C40
zbMATH DE Number: 94330
zbMATH Keywords: dense digraphs
zbMATH Keywords: interconnection network
zbMATH Keywords: super-\(\lambda\)
zbMATH Keywords: network reliability
zbMATH Keywords: edge-connectivity
zbMATH Keywords: diameter
zbMATH Keywords: minimum edge-cut sets
zbMATH Keywords: de Bruijn digraph
zbMATH Keywords: Kautz digraph
MaRDI profile type: Publication
cites work: Q3922713
cites work: Q3941433
cites work: Large fault-tolerant interconnection networks
cites work: Synthesis of reliable networks - a survey
cites work: On the Invulnerability of the Regular Complete k-Partite Graphs
cites work: Super Line-Connectivity Properties of Circulant Graphs
cites work: Advances in graph theory
cites work: On the impossibility of directed Moore graphs
cites work: Q5834367
cites work: Lower-bounds on the connectivities of a graph
cites work: Maximally connected digraphs
cites work: Line Digraph Iterations and the (d, k) Digraph Problem
cites work: Q4044620
cites work: On the design of reliable networks
cites work: Design to Minimize Diameter on Building-Block Network
cites work: A Design for Directed Graphs with Minimum Diameter
cites work: Connectivity of Regular Directed Graphs with Small Diameters
cites work: Graphs with the smallest number of minimum cut sets
cites work: Design of a \(d\)-connected digraph with a minimum number of edges and a quasiminimal diameter. II
cites work: Design of a d-connected digraph with a minimum number of edges and a quasiminimal diameter
cites work: Sufficient conditions for maximally connected dense graphs
full work available at URL: 0166-218x(92)90155-4
OpenAlex ID: W1995580361
description: scientific article; zbMATH DE number 94330