相关论文: Structure fault diameter of hypercubes

The twin-width of a graph measures its distance to co-graphs and generalizes classical width concepts such as tree-width or rank-width. Since its introduction in 2020 (Bonnet et. al. 2020), a mass of new results has appeared relating twin…

Liquid water, besides being fundamental for life on Earth, has long fascinated scientists due to several anomalies. Different hypotheses have been put forward to explain these peculiarities. The most accredited one foresees the presence in…

Graph eigenvalues play a fundamental role in controlling structural properties, such as bisection bandwidth, diameter, and fault tolerance, which are critical considerations in the design of supercomputing interconnection networks. This…

Connectivity and diagnosability are two important parameters for the fault tolerant of an interconnection network $G$. In 1996, F\`{a}brega and Fiol proposed the $g$-extra connectivity of $G$. A subset of vertices $S$ is said to be a…

In this work, we introduce a method to construct fault-tolerant measurement-based quantum computation (MBQC) architectures and numerically estimate their performance over various types of networks. A possible application of such a paradigm…

Let $G=(V, E)$ be a connected graph, a subset $S\subseteq V(G)$ is called an $R^{g}$-vertex-cut of $G$ if $G-F$ is disconnected and any vertex in $G-F$ has at least $g$ neighbours in $G-F$. The $R^{g}$-vertex-connectivity is the size of the…

Structure entails function and thus a structural description of the brain will help to understand its function and may provide insights into many properties of brain systems, from their robustness and recovery from damage, to their dynamics…

In this paper, we demonstrate a conflicting relationship between two crucial properties---controllability and robustness---in linear dynamical networks of diffusively coupled agents. In particular, for any given number of nodes $N$ and…

The $n$-dimensional random twisted hypercube $\mathbf{G}_n$ is constructed recursively by taking two instances of $\mathbf{G}_{n-1}$, with any joint distribution, and adding a random perfect matching between their vertex sets. Benjamini,…

Connectivity of wireless sensor networks (WSNs) is a fundamental global property expected to be maintained even though some sensor nodes are at fault. In this paper, we investigate the connectivity of random geometric graphs (RGGs) in the…

The two-dimensional Hubbard model is studied for small values of the interaction strength (U of the order of the hopping amplitude t), using a variational ansatz well suited for this regime. The wave function, a refined Gutzwiller ansatz,…

An $f$-edge (or vertex) connectivity certificate is a sparse subgraph that maintains connectivity under the failure of at most $f$ edges (or vertices). It is well known that any $n$-vertex graph admits an $f$-edge (or vertex) connectivity…

Over the past years, one witnesses a growing interest in flat band (FB) physics which has become a playground for exotic phenomena. In this study, we address the FB superconductivity in onedimensional stub chain. In contrast to the sawtooth…

The h-extra connectivity is an important parameter to measure the reliability and fault tolerance ability of large interconnection networks. The k-ary n-cube is an important interconnection network of parallel computing systems. The…

Computing the diameter of the intersection graphs of objects is a basic problem in computational geometry. Previous works showed that the complexity of computing the diameter mainly depends on the object types: for unit disks and squares in…

Finding strongly connected components (SCCs) and the diameter of a directed network play a key role in a variety of discrete optimization problems, and subsequently, machine learning and control theory problems. On the one hand, SCCs are…

Let $G$ be a finite simple non-complete connected graph on $[n] = \{1, \ldots, n\}$ and $\kappa(G) \geq 1$ its vertex connectivity. Let $f(G)$ denote the number of free vertices of $G$ and $\mathrm{diam}(G)$ the diameter of $G$. The final…

This paper focuses on the embeddability of hypercubes in an important class of Cayley graphs, known as augmented cubes. An $n$-dimensional augmented cube $AQ_n$ is constructed by augmenting the $n$-dimensional hypercube $Q_n$ with…

The morphology of defects formed in collision cascades is an essential aspect of the subsequent evolution of the microstructure. The morphological composition of a defect decides its stability, interaction, and migration properties. We…

Let $G$ be a connected nonregular graphs of order $n$ with maximum degree $\Delta$ that attains the maximum spectral radius. Liu and Li (2008) proposed a conjecture stating that $G$ has a degree sequence $(\Delta,\ldots,\Delta,\delta)$ with…