On super-edge-connected digraphs and bipartite digraphs
From MaRDI portal
Publication:4016021
DOI10.1002/jgt.3190160603zbMath0769.05062OpenAlexW2064168004MaRDI QIDQ4016021
No author found.
Publication date: 17 December 1992
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190160603
Structural characterization of families of graphs (05C75) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)
Related Items (21)
Super edge-connectivity and zeroth-order general Randić index for \(-1 \leq \alpha < 0\) ⋮ Neighborhood and degree conditions for super-edge-connected bipartite digraphs ⋮ Optimization problems of the third edge-connectivity of graphs ⋮ On the order and size of \(s\)-geodetic digraphs with given connectivity ⋮ Super Edge-Connected Linear Hypergraphs ⋮ A characterization of graphs by codes from their incidence matrices ⋮ Degree sequence conditions for maximally edge-connected and super-edge-connected digraphs depending on the clique number ⋮ Sufficient conditions for triangle-free graphs to be super \(k\)-restricted edge-connected ⋮ Super edge-connectivity and zeroth-order Randić index ⋮ Restricted arc-connectivity of generalized \(p\)-cycles ⋮ Zero-divisor super-\(\lambda\) graphs ⋮ Codes from incidence matrices of graphs ⋮ Edge fault tolerance of super edge connectivity for three families of interconnection networks ⋮ Maximally edge-connected and vertex-connected graphs and digraphs: A survey ⋮ Inverse degree and super edge-connectivity ⋮ Super-edge-connectivity and zeroth-order Randić index ⋮ Sufficient conditions for super-arc-strongly connected oriented graphs ⋮ Sufficient conditions for \(\lambda'\)-optimality in graphs of diameter 2 ⋮ Inverse degree and edge-connectivity ⋮ Superconnectivity of bipartite digraphs and graphs ⋮ On connectivity of the cartesian product of two graphs
Cites Work
This page was built for publication: On super-edge-connected digraphs and bipartite digraphs
