Inverse degree and edge-connectivity (Q1043655)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Inverse degree and edge-connectivity	scientific article

Statements

scholarly article

0 references

Inverse degree and edge-connectivity (English)

0 references

Angelika Hellwig

0 references

0 references

Peter Dankelmann

0 references

Discrete Mathematics

0 references

publication date

9 December 2009

0 references

zbMATH Keywords

edge-connectivity

0 references

inverse degree

0 references

describes a project that uses

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.disc.2008.06.041

0 references

A Graph-Theoretic Approach to a Communications Problem

0 references

0 references

Diameter and inverse degree

0 references

0 references

0 references

0 references

0 references

On super-edge-connected digraphs and bipartite digraphs

0 references

A sufficient condition for equality of edge-connectivity and minimum degree of a graph

0 references

Results on the edge-connectivity of graphs

0 references

0 references

0 references

0 references

A sufficient condition for equality of arc-connectivity and minimum degree of a digraph

0 references

Identifiers

zbMATH Open document ID

0 references

10.1016/j.disc.2008.06.041

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1043655

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1043655&oldid=35142535"