Structure and substructure connectivity of circulant graphs and hypercubes
Authors:
- T. Tamizh ChelvamTCT. Tamizh Chelvam
- M. SivagamiMSM. Sivagami
Open Access
- 19 August 2020
- journal article
- Published by Emerald Publishing in Arab Journal of Mathematical Sciences
- Vol. 27 (1) , 94-103
Abstract
Let H be a connected subgraph of a connected graph G . The H -structure connectivity of the graph G , denoted by κ ( G ; H ) , is the minimum cardinality of a minimal set of subgraphs F = { H 1 ′ , H 2 ′ , … , H m ′ } in G , such that every H ′ i ∈ F is isomorphic to H and removal of F from G will disconnect G . The H -substructure connectivity of the graph G , denoted by κ s ( G ; H ) , is the minimum cardinality of a minimal set of subgraphs F = { J 1 ′ , J 2 ′ , … , J m ′ } in G , such that every J i ′ ∈ F is a connected subgraph of H and removal of F from G will disconnect G . In this paper, we provide the H -structure and the H -substructure connectivity of the circulant graph Cir ( n , Ω ) where Ω = { 1 , … , k , n − k , … , n − 1 } , 1 ≤ k ≤ ⌊ n 2 ⌋ and the hypercube Q n for some connected subgraphs H .Keywords
Funding Information
- INSPIRE, India (IF160672)
- Department of Science and Technology, Government of India
This publication has 5 references indexed in Scilit:
- Domination in Cayley graphs: A surveyAKCE International Journal of Graphs and Combinatorics, 2019
- Structure connectivity of hypercubesAKCE International Journal of Graphs and Combinatorics, 2018
- Structure connectivity and substructure connectivity of hypercubesTheoretical Computer Science, 2016
- Independent perfect domination sets in Cayley graphsJournal of Graph Theory, 2001
- Ring, torus and hypercube architectures/algorithms for parallel computingParallel Computing, 1999