Toughness of the corona of two graphs
From MaRDI portal
Publication:2885501
DOI10.1080/00207160.2011.564277zbMath1238.05141OpenAlexW1988677265MaRDI QIDQ2885501
A. Diánez, Rocio M. Casablanca, Pedro García-Vázquez
Publication date: 23 May 2012
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160.2011.564277
Related Items (3)
Total $k$-domination in strong product graphs ⋮ Simultaneous resolvability in families of corona product graphs ⋮ The differential of the strong product graphs
Cites Work
- On toughness and fractional \((g,f,n)\)-critical graphs
- Recognizing tough graphs is NP-hard
- Maximally edge-connected and vertex-connected graphs and digraphs: A survey
- Vertex vulnerability parameters of Kronecker products of complete graphs
- Some results related to the tenacity and existence of \(k\)-trees
- Extraconnectivity of graphs with large girth
- Toughness, degrees and 2-factors
- On the extraconnectivity of graphs
- Toughness and matching extension in \({\mathcal{P}_3}\)-dominated graphs
- Toughness in graphs -- a survey
- Edge vulnerability parameters of bisplit graphs
- On the corona of two graphs
- Tough graphs and Hamiltonian circuits.
- A survey of some network reliability analysis and synthesis results
- Circulants and their connectivities
- On the Toughness of a Graph
- Vertex-neighbour-integrity of composition graphs of paths and cycles
- Synthesis of reliable networks - a survey
- Various results on the toughness of graphs
- Computing the Scattering Number of Graphs
- Vulnerability parameters of split graphs
- On the edge-tenacity of the middle graph of a graph
This page was built for publication: Toughness of the corona of two graphs
