Connectivity of strong products of graphs
From MaRDI portal
Publication:1959713
DOI10.1007/s00373-010-0919-8zbMath1213.05154OpenAlexW1963704255MaRDI QIDQ1959713
Publication date: 7 October 2010
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-010-0919-8
Related Items (17)
Intervals and convex sets in strong product of graphs ⋮ The Restricted Edge-Connectivity of Kronecker Product Graphs ⋮ A sharp lower bound for the generalized 3-edge-connectivity of strong product graphs ⋮ A characterization of the edge connectivity of direct products of graphs ⋮ The Menger number of the strong product of graphs ⋮ Gromov hyperbolicity in strong product graphs ⋮ On edge connectivity of direct products of graphs ⋮ The pre-hull number and lexicographic product ⋮ Proper connection number of graph products ⋮ On generalized 3-connectivity of the strong product of graphs ⋮ SUPER EDGE CONNECTIVITY OF KRONECKER PRODUCTS OF GRAPHS ⋮ Rainbow vertex-connection and graph products ⋮ Rainbow connection and graph products ⋮ Connectivity of semicartesian products ⋮ Matching preclusion for direct product of regular graphs ⋮ Separation of Cartesian products of graphs into several connected components by the removal of edges ⋮ On d-distance equitable chromatic number of some graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A characterization of the edge connectivity of direct products of graphs
- Connectivity of generalized prisms over G
- Connectivity of Cartesian products of graphs
- On connectivity of the cartesian product of two graphs
- Distance and connectivity measures in permutation graphs
- Improved lower bound on the Shannon capacity of \(C_7\)
- On the edge-connectivity and restricted edge-connectivity of a product of graphs
- On induced and isometric embeddings of graphs into the strong product of paths
- Local chromatic number and Sperner capacity
- ON THE EDGE-CONNECTIVITY OF CARTESIAN PRODUCT GRAPHS
- Hamiltonian threshold for strong products of graphs
- Hamilton cycles in strong products of graphs
- On restricted connectivities of permutation graphs
- A limit theorem for the Shannon capacities of odd cycles. II
- Cardinal multiplication of structures with a reflexive relation
This page was built for publication: Connectivity of strong products of graphs