On the edge-connectivity and restricted edge-connectivity of a product of graphs
From MaRDI portal
Publication:2462383
DOI10.1016/J.DAM.2007.06.014zbMath1127.05058OpenAlexW2045736190MaRDI QIDQ2462383
A. Diánez, Martín Cera, Camino Balbuena, Xavier Marcote, Pedro García-Vázquez
Publication date: 30 November 2007
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2007.06.014
Related Items (11)
\(\{2,3\}\)-extraconnectivities of hypercube-like networks ⋮ A new approach to finding the extra connectivity of graphs ⋮ On restricted edge-connectivity of lexicographic product graphs ⋮ Edge fault tolerance of graphs with respect to super edge connectivity ⋮ On optimizing edge connectivity of product graphs ⋮ Connectivity of strong products of graphs ⋮ Edge fault tolerance of super edge connectivity for three families of interconnection networks ⋮ Cyclic arc-connectivity in a Cartesian product digraph ⋮ Some remarks on \(\lambda _{p,q}\)-connectedness ⋮ Separation of Cartesian products of graphs into several connected components by the removal of edges ⋮ On the 3-restricted edge connectivity of permutation graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Large graphs with given degree and diameter. II
- Connectivity of generalized prisms over G
- Connectivity of Cartesian product graphs
- On the restricted connectivity and superconnectivity in graphs with given girth
- Sufficient conditions for maximally connected dense graphs
- On computing a conditional edge-connectivity of a graph
- On connectivity of the cartesian product of two graphs
- Distance and connectivity measures in permutation graphs
- Large survivable nets and the generalized prisms
- Grands Graphes De Degré Et Diamètre Fixés
- Connectivity of Regular Directed Graphs with Small Diameters
- Circulants and their connectivities
- Synthesis of reliable networks - a survey
- On diameter of permutation graphs
- On restricted connectivities of permutation graphs
- Super edge- and point-connectivities of the Cartesian product of regular graphs
- Sufficient conditions for λ′‐optimality in graphs with girth g
- A Graph-Theoretic Approach to a Communications Problem
This page was built for publication: On the edge-connectivity and restricted edge-connectivity of a product of graphs
