相关论文: Extra connectivity measures of 3-ary n-cubes

Rainbow connection number, $rc(G)$, of a connected graph $G$ is the minimum number of colours needed to colour its edges, so that every pair of vertices is connected by at least one path in which no two edges are coloured the same. In this…

In this paper, we consider the question of computing sparse subgraphs for any input directed graph $G=(V,E)$ on $n$ vertices and $m$ edges, that preserves reachability and/or strong connectivity structures. We show $O(n+\min\{|{\cal…

Let $G$ be a graph of order $n$ and let $u,v$ be vertices of $G$. Let $\kappa_G(u,v)$ denote the maximum number of internally disjoint $u$-$v$ paths in $G$. Then the average connectivity $\overline{\kappa}(G)$ of $G$, is defined as $…

A cactus is a connected graph in which each edge is contained in at most one cycle. We generalize the concept of cactus graphs, i.e., a $k$-cactus is a connected graph in which each edge is contained in at most $k$ cycles where $k\ge 1$. It…

We show that among any $n$ points in the unit cube one can find a triangle of area at most $n^{-2/3-c}$ for some absolute constant $c >0$. This gives the first non-trivial upper bound for the three-dimensional version of Heilbronn's…

Consider the $n$-cube graph with vertices $\{-1,1\}^n$ and edges connecting vertices with hamming distance $1$. How many hyperplanes in $\mathbb{R}^n$ are needed in order to dissect all edges? We show that at least…

Let T1, T2,..., Tk be spanning trees in a graph G. If for any pair of vertices {u, v} of G, the paths between u and v in every Ti( 0 < i < k+1) do not contain common edges and common vertices, except the vertices u and v, then T1, T2,...,…

Motivated by work of Erd\H{o}s, Ota determined the maximum size $g(n,k)$ of a $k$-connected nonhamiltonian graph of order $n$ in 1995. But for some pairs $n,k,$ the maximum size is not attained by a graph of connectivity $k.$ For example,…

We derive the critical nearest-neighbor connectivity $g_n$ as $3/4$, $3(7-9p_c^{tri})/[4(5-4p_c^{tri})]$, and $3(2+7p_c^{tri})/[4(5-p_c^{tri})]$ for bond percolation on the square, honeycomb and triangular lattice respectively, where…

The spined cube $SQ_n$ is a variant of the hypercube $Q_n$, introduced by Zhou et al. in [Information Processing Letters 111 (2011) 561-567] as an interconnection network for parallel computing. A graph $\G$ is an $m$-Cayley graph if its…

We examine a realistic 3-band model, finding it capable of exhibiting the d-wave pairing characteristic of CuO2-based high-Tc superconductors, but only in the presence of symmetry-lowering charge-density stripes aligned along (1,0) axes,…

Faulty networks are useful because link or node faults can occur in a network. This paper examines the Hamiltonian properties of hypercubes under certain conditional faulty edges. Let consider the hypercube \( Q_n \), for \( n \geq 5 \) and…

Let $G_1,\dots, G_m$ be independent identically distributed Bernoulli random subgraphs of the complete graph ${\cal K}_n$ having vertex sets of random sizes $X_1,\dots, X_m\in \{0,1,2,\dots\}$ and random edge densities $Q_1,\dots, Q_m\in…

In this survey we overview known results on the strong subgraph $k$-connectivity and strong subgraph $k$-arc-connectivity of digraphs. After an introductory section, the paper is divided into four sections: basic results, algorithms and…

The cyclic edge-connectivity of a graph $G$ is the least $k$ such that there exists a set of $k$ edges whose removal disconnects $G$ into components where every component contains a cycle. We show that for graphs of minimum degree at least…

Let $S$ be a nonempty set of vertices of a connected graph $G$. A collection $T_1,..., T_\ell$ of trees in $G$ is said to be internally disjoint trees connecting $S$ if $E(T_i)\cap E(T_j)= \emptyset$ and $V(T_i)\cap V(T_j)=S$ for any pair…

A vertex cut $S$ of a connected graph $G$ is a subset of vertices of $G$ whose deletion makes $G$ disconnected. A super vertex cut $S$ of a connected graph $G$ is a subset of vertices of $G$ whose deletion makes $G$ disconnected and there…

The $\ell$-component connectivity (or $\ell$-connectivity for short) of a graph $G$, denoted by $\kappa_\ell(G)$, is the minimum number of vertices whose removal from $G$ results in a disconnected graph with at least $\ell$ components or a…

A network where three users want to establish multiple unicasts between each other via a relay is considered. This network is called the Y-channel and resembles an elemental ingredient of future wireless networks. The sum-capacity of this…

A space is `n-arc connected' (n-ac) if any family of no more than n-points are contained in an arc. For graphs the following are equivalent: (i) 7-ac, (ii) n-ac for all n, (iii) continuous injective image of a closed sub-interval of the…