Edge-connectivity and edge-superconnectivity in sequence graphs
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 2191995
- Construction of super edge-connected multigraphs with prescribed degrees.
- Super Edge-Connected Linear Hypergraphs
- Sufficient conditions for maximally edge-connected and super-edge-connected graphs
- Degree sequence conditions for maximally edge-connected and super edge-connected hypergraphs
Cites work
- scientific article; zbMATH DE number 3859160 (Why is no real title available?)
- scientific article; zbMATH DE number 4162905 (Why is no real title available?)
- scientific article; zbMATH DE number 3735859 (Why is no real title available?)
- scientific article; zbMATH DE number 1744097 (Why is no real title available?)
- scientific article; zbMATH DE number 2197898 (Why is no real title available?)
- A sufficient condition for \(P_{k}\)-path graphs being \(r\)-connected
- Circulants and their connectivities
- Connectivity of iterated line graphs
- Edge-connectivity and super edge-connectivity of \(P_{2}\)-path graphs
- Edge-connectivity in \(P_k\)-path graphs
- Graphs on alphabets as models for large interconnection networks
- Line Digraph Iterations and the (d, k) Digraph Problem
- Maximally connected digraphs
- Path graphs
- Super edge-connectivity of dense digraphs and graphs
- Synthesis of reliable networks - a survey
Cited in
(2)
This page was built for publication: Edge-connectivity and edge-superconnectivity in sequence graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2384389)
