Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1609.08885

On $g$-Extra Connectivity of Hypercube-like Networks

Jin-Xin Zhou
View original source ↗Read source document ↗Export metadata ↓

Abstract

Given a connected graph $G$ and a non-negative integer $g$, the {\em $g$-extra connectivity} $\k_g(G)$ of $G$ is the minimum cardinality of a set of vertices in $G$, if it exists, whose deletion disconnects $G$ and leaves each remaining component with more than $g$ vertices. This paper focuses on the $g$-extra connectivity of hypercube-like networks (HL-networks for short) which includes numerous well-known topologies, such as hypercubes, twisted cubes, crossed cubes and Möbius cubes. All the known results suggest the equality $\k_g(X_n)=f_n(g)$ holds, where $X_n$ is an $n$-dimensional HL-network, $f_n(g)=n(g+1)-\frac{g(g+3)}{2}$, $n\geq 5$ and $0\leq g\leq n-3$? Some authors also attempted to prove this equality in general. In this paper, we construct a subfamily of an $n$-dimensional HL-network with $g$-extra connectivity greater than $f_n(g)$ which implies that the above equality does not hold in general. We also prove that for $n\geq 5$ and $0\leq g\leq n-3$, $\k_g(X_n)\geq f_n(g)$ always holds. This enables us to give a sufficient condition for the equality $\k_g(X_n)=f_n(g)$, which is then used to determine the $g$-extra connectivity of HL-networks for some small $g$ or the $g$-extra connectivity of some particular subfamily of HL-networks. As a result, a short proof for the main results in [Journal of Computer and System Sciences 79 (2013) 669--688].

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jin-Xin Zhou. 2016-09-28. On $g$-Extra Connectivity of Hypercube-like Networks. https://arxiv.org/abs/1609.08885

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO↗
arXiv2026

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO↗