相关论文: Structure fault diameter of hypercubes

The Survivable Network Design problem (SNDP) is a well-studied problem, motivated by the design of networks that are robust to faults under the assumption that any subset of edges up to a specific number can fail. We consider non-uniform…

As a generalization of super magic strength, the strength of a graph was introduced in [R. Ichishima, F.A. Muntaner-Batle, A. Oshima, Bounds for the strength of graphs, Austral. J. of Combin. 72(3) (2018) 492-508]. For a vertex ordering $f$…

Let $D(G)$ denote the distance matrix of a connected graph $G$ with $n$ vertices. The distance spectral gap of a graph $G$ is defined as $\delta_{D^G} = \rho_1 - \rho_2$, where $\rho_1$ and $\rho_2$ represent the largest and second largest…

HyperSurfaces are a merge of structurally reconfigurable metasurfaces whose electromagnetic properties can be changed via a software interface, using an embedded miniaturized network of controllers, thus enabling novel capabilities in…

The ability to identify interesting and repetitive substructures is an essential component to discovering knowledge in structural data. We describe a new version of our SUBDUE substructure discovery system based on the minimum description…

The concept of optimal communication channels shapes our understanding of wave-based communication. Its analysis, however, always pertains to specific communication-domain geometries, without a general theory of scaling laws or fundamental…

The $d$-dimensional algebraic connectivity $a_d(G)$ of a graph $G=(V,E)$ is a quantitative measure of its $d$-dimensional rigidity, defined in terms of the eigenvalues of stiffness matrices associated with different embeddings of the graph…

Modular architectures are a promising approach to scale quantum devices to the point of fault tolerance and utility. Modularity is particularly appealing for superconducting qubits, as monolithically manufactured devices are limited in both…

This book studies ultrafilters on connectivity systems, that is, on pairs \((X,f)\) where \(X\) is a finite set and \(f:2^{X}\to \mathbb{N}\) is a symmetric submodular function. Ultrafilters, which play a fundamental role in topology and…

This paper presents new results and reinterpretation of existing conditions for strong structural controllability in a structured network determined by the zero/non-zero patterns of edges. For diffusively-coupled networks with self-loops,…

Flexible network design deals with building a network that guarantees some connectivity requirements between its vertices, even when some of its elements (like vertices or edges) fail. In particular, the set of edges (resp. vertices) of a…

Fault-tolerant spanners are fundamental objects that preserve distances in graphs even under edge failures. A long line of work culminating in Bodwin, Dinitz, Robelle (SODA 2022) gives $(2k-1)$-stretch, $f$-fault-tolerant spanners with…

The Steiner tree problem in graphs has applications in network design or circuit layout. Given a set $S$ of vertices, $|S| \geq 2,$ a tree connecting all vertices of $S$ is called an $S$-Steiner tree (tree connecting $S$). The reliability…

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$-good-neighbor connectivity of $G$. In this paper, we show that $1\leq…

A resolving set for a simple graph $G$ is a subset of vertex set of $G$ such that it distinguishes all vertices of $G$ using the shortest distance from this subset. This subset is a metric basis if it is the smallest set with this property.…

Through detailed analysis of scores of publicly available data sets corresponding to a wide range of large-scale networks, from communication and road networks to various forms of social networks, we explore a little-studied geometric…

For a graph $G$, its \emph{cubicity} $cub(G)$ is the minimum dimension $k$ such that $G$ is representable as the intersection graph of (axis--parallel) cubes in $k$--dimensional space. Chandran, Mannino and Oriolo showed that for a…

Diffusion dynamics in multiplex networks can model a diverse number of real-world processes. In some specific configurations of these systems, the super-diffusion phenomenon arises, in which the diffusion is faster in the multiplex network…

A standard approach to reduce the complexity of very large networks is to group together sets of nodes into clusters according to some criterion which reflects certain structural properties of the network. Beyond the well-known modularity…

The problem of cascading failures in cyber-physical systems is drawing much attention in lieu of different network models for a diverse range of applications. While many analytic results have been reported for the case of large networks,…