Extra Connectivity of Strong Product of Graphs

TL;DR

This paper investigates the g-extra connectivity of the strong product of two maximally connected regular graphs, providing specific results for g ≤ 3, and explores implications for fault-diagnosability under the PMC model.

Contribution

It derives the g-extra connectivity for the strong product of two regular graphs and links it to fault-diagnosability, a novel extension in graph theory.

Findings

g-extra connectivity for strong product graphs with g ≤ 3

Results applicable to maximally connected regular graphs

Implications for fault-diagnosability under PMC model

Abstract

The $g$-$extra$ $connectivity$ $\kappa_{g}(G)$ of a connected graph $G$ is the minimum cardinality of a set of vertices, if it exists, whose deletion makes $G$ disconnected and leaves each remaining component with more than $g$ vertices, where $g$ is a non-negative integer. The $strong$ $product$ $G_1 \boxtimes G_2$ of graphs $G_1$ and $G_2$ is the graph with vertex set $V(G_1 \boxtimes G_2)=V(G_1)\times V(G_2)$, where two distinct vertices $(x_{1}, y_{1}),(x_{2}, y_{2}) \in V(G_1)\times V(G_2)$ are adjacent in $G_1 \boxtimes G_2$ if and only if $x_{1}=x_{2}$ and $y_{1} y_{2} \in E(G_2)$ or $y_{1}=y_{2}$ and $x_{1} x_{2} \in E(G_1)$ or $x_{1} x_{2} \in E(G_1)$ and $y_{1} y_{2} \in E(G_2)$. In this paper, we give the $g\ (\leq 3)$-$extra$ $connectivity$ of $G_1\boxtimes G_2$, where $G_i$ is a maximally connected $k_i\ (\geq 2)$-regular graph for $i=1,2$. As a byproduct, we get $g\ (\leq 3)$-$extra$ conditional fault-diagnosability of $G_1\boxtimes G_2$ under $PMC$ model.