Connectivity and super-connectivity of Cartesian product graphs
نویسندگان
چکیده
This paper determines that the connectivity of the Cartesian product G1 G2 of two graphs G1 and G2 is equal to min{κ1v2, κ2v1, δ1 + δ2}, where vi, κi, δi is the order, the connectivity and the minimum degree of Gi, respectively, for i = 1, 2, and gives some necessary and sufficient conditions for G1 G2 to be maximally connected and super-connected.
منابع مشابه
On restricted edge connectivity of regular Cartesian product graphs
Explicit expressions of the restricted edge connectivity of the Cartesian product of regular graphs are presented; some sufficient conditions for regular Cartesian product graphs to be maximally or super restricted edge connected are obtained as a result.
متن کاملSufficient conditions for maximally edge-connected and super-edge-connected
Let $G$ be a connected graph with minimum degree $delta$ and edge-connectivity $lambda$. A graph ismaximally edge-connected if $lambda=delta$, and it is super-edge-connected if every minimum edge-cut istrivial; that is, if every minimum edge-cut consists of edges incident with a vertex of minimum degree.In this paper, we show that a connected graph or a connected triangle-free graph is maximall...
متن کاملOn super edge-connectivity of Cartesian product graphs
The super edge-connectivity λ′ of a connected graph G is the minimum cardinality of an edge-cut F in G such that every component of G − F contains at least two vertices. LetGi be a connected graph with order ni , minimum degree δi and edge-connectivity λi for i = 1, 2. This article shows that λ′(G1 × G2) ≥ min{n1 λ2,n2 λ1,λ1 + 2λ2, 2λ1+λ2} forn1,n2 ≥ 3 andλ′(K2×G2) = min{n2, 2λ2}, which general...
متن کاملOn the super domination number of graphs
The open neighborhood of a vertex $v$ of a graph $G$ is the set $N(v)$ consisting of all vertices adjacent to $v$ in $G$. For $Dsubseteq V(G)$, we define $overline{D}=V(G)setminus D$. A set $Dsubseteq V(G)$ is called a super dominating set of $G$ if for every vertex $uin overline{D}$, there exists $vin D$ such that $N(v)cap overline{D}={u}$. The super domination number of $G$ is the minimum car...
متن کاملThe k-restricted edge-connectivity of a product of graphs
This work deals with a generalization of the Cartesian product of graphs, the product graph Gm ∗Gp introduced by Bermond et al. [J.C. Bermond, C. Delorme, G. Farhi, Large graphs with givendegree anddiameter II, J. Combin. Theory, Series B 36 (1984), 32–48]. The connectivity of these product graphs is approached by studying the k-restricted edge-connectivity, which is defined as the minimum numb...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Ars Comb.
دوره 95 شماره
صفحات -
تاریخ انتشار 2010