Connectivity measures in matched sum graphs
From MaRDI portal
Publication:952660
DOI10.1016/j.disc.2007.04.051zbMath1155.05036OpenAlexW1975812829MaRDI QIDQ952660
Xavier Marcote, Camino Balbuena, Pedro García-Vázquez
Publication date: 12 November 2008
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2007.04.051
ConnectivityRestricted edge-connectivityEdge-connectivitymatched sum graphRestricted connectivitySuperconnectivity
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Connectivity of generalized prisms over G
- On the restricted connectivity and superconnectivity in graphs with given girth
- On computing a conditional edge-connectivity of a graph
- Extraconnectivity of graphs with large minimum degree and girth
- Distance and connectivity measures in permutation graphs
- Every cubic cage is quasi 4-connected
- On generalized Petersen graphs labeled with a condition at distance two
- Large survivable nets and the generalized prisms
- On the extraconnectivity of graphs
- On restricted connectivity and extra connectivity of hypercubes and folded hypercubes
- Circulants and their connectivities
- Conditional connectivity
- Synthesis of reliable networks - a survey
- On restricted connectivities of permutation graphs
- Sufficient conditions for λ′‐optimality in graphs with girth g
This page was built for publication: Connectivity measures in matched sum graphs