scientific article; zbMATH DE number 1062587

DOI10.1002/(SICI)1097-0118(199709)26:1%3C27::AID-JGT4%3E3.0.CO;2-JMaRDI QIDQ4355069zbMATH OpenFDO

Authors Peter Dankelmann, Lutz Volkmann

Publication date 22 December 1997

Full work available at URL https://doi.org/10.1002/(SICI)1097-0118(199709)26:1%3C27::AID-JGT4%3E3.0.CO;2-J

zbMATH Keywords

bipartitedegree sequencedigraphedge-connectivitygraphminimum degree

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)

Recommendations

• scientific article; zbMATH DE number 1933046
• Degree sequence conditions for maximally edge-connected oriented graphs
• Degree sequence conditions for maximally edge-connected graphs depending on the clique number

Cited in

(28)

• Degree sequence conditions for maximally edge-connected oriented graphs
• Inverse degree and edge-connectivity
• Super edge-connectivity and zeroth-order general Randić index for \(-1 \leq \alpha < 0\)
• Degree sequences and edge connectivity
• Neighborhood and degree conditions for super-edge-connected bipartite digraphs
• Degree sequence conditions for maximally edge-connected graphs depending on the clique number
• Degree sequence conditions for maximally edge-connected and super edge-connected hypergraphs
• Super edge-connectivity and zeroth-order Randić index
• Super-edge-connectivity and zeroth-order Randić index
• Maximally edge-connected graphs and zeroth-order general Randić index for \(0<\alpha <1\)
• Sufficient conditions for restricted-edge-connectivity to be optimal
• Local-edge-connectivity in digraphs and oriented graphs
• scientific article; zbMATH DE number 4208109 (Why is no real title available?)
• Degree sequences of optimally edge-connected multigraphs.
• scientific article; zbMATH DE number 1933046 (Why is no real title available?)
• Degree sequence conditions for equal edge‐connectivity and minimum degree, depending on the clique number
• scientific article; zbMATH DE number 822753 (Why is no real title available?)
• Sufficient conditions for optimally and super m-restricted edge-connected graphs with given girth
• Super Edge-Connected Linear Hypergraphs
• Degree sequence conditions for maximally and super edge-connected digraphs depending on the clique number
• On the edge-connectivity of C₄-free graphs
• Maximally edge-connected graphs and zeroth-order general Randić index for -1
• On optimizing edge connectivity of product graphs
• On the edge-connectivity of the square of a graph
• On the size of linear r-uniform hypergraphs and sufficient conditions for maximally edge-connected hypergraphs
• On the maximal edge-connectedness of the third power graph
• Degree conditions for restricted-edge-connectivity and isoperimetric-edge-connectivity to be optimal
• Maximally edge-connected and vertex-connected graphs and digraphs: A survey

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4355069)