Separation of Cartesian products of graphs on several connected components by the removal of edges
From MaRDI portal
Publication:3390790
Recommendations
- Separation of Cartesian products of graphs into several connected components by the removal of vertices
- Generalized 3-edge-connectivity of Cartesian product graphs.
- Sharp upper bounds for generalized edge-connectivity of product graphs
- Generalized 3-connectivity and 3-edge-connectivity for the Cartesian products of some graph classes
- scientific article; zbMATH DE number 7117009
Cites work
- A characterization of the edge connectivity of direct products of graphs
- Connectivity of Cartesian products of graphs
- Connectivity of strong products of graphs
- Edge-connectivity of strong products of graphs
- Generalized Connectivity of Graphs
- Handbook of product graphs
- Large graphs with given degree and diameter. II
- ON THE EDGE-CONNECTIVITY OF CARTESIAN PRODUCT GRAPHS
- On edge connectivity of direct products of graphs
- On restricted edge connectivity of strong product graphs.
- On the connectivity of the direct product of graphs
- On the edge-connectivity and restricted edge-connectivity of a product of graphs
- On the generalized (edge-)connectivity of graphs
- Rainbow trees in graphs and generalized connectivity
- Reliability of interconnection networks modeled by a product of graphs
- Separation of graphs into three components by the removal of edges
- Superconnectivity of networks modeled by the strong product of graphs
Cited in
(1)
This page was built for publication: Separation of Cartesian products of graphs on several connected components by the removal of edges
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3390790)
