Related papers: Neighbor Connectivity of Undirected Toroidal Meshe…

The neighbor connectivity of a graph $G$ is the least number of vertices such that removing their closed neighborhoods from $G$ results in a graph that is disconnected, complete or empty. If a~graph is used to model the topology of an…

Let $G$ be a finite graph and $\kappa(G)$ the vertex connectivity of $G$. A chordal graph $G$ is called chordal$^*$ if no vertex of $G$ is adjacent to all other vertices of $G$. Using the syzygy theory in commutative algebra, it is proved…

We introduce $\mathcal{B}_{\kappa}$-embeddings, nonlinear mathematical structures that connect, through smooth paths parameterized by $\kappa$, a finite or denumerable set of objects at $\kappa=0$ (e.g. numbers, functions, vectors,…

Let $S\subseteq V(G)$ and $\kappa_{G}(S)$ denote the maximum number $k$ of edge-disjoint trees $T_{1}, T_{2}, \cdots, T_{k}$ in $G$ such that $V(T_{i})\bigcap V(T_{j})=S$ for any $i, j \in \{1, 2, \cdots, k\}$ and $i\neq j$. For an integer…

Given an arbitrary measurable cardinal $\kappa$, a nondiscrete Hausdorff extremally disconnected topological group of cardinality $\kappa$ is constructed.

Complex systems may morph between structures with different dimensionality and degrees of freedom. As a tool for their modelling, nonlinear embeddings are introduced that encompass objects with different dimensionality as a continuous…

The neuronal networks in the mammals cortex are characterized by the coexistence of hierarchy, modularity, short and long range interactions, spatial correlations, and topographical connections. Particularly interesting, the latter type of…

The widespread enthusiasm for deep learning has recently expanded into the domain of tabular data. Recognizing that the advancement in deep tabular methods is often inspired by classical methods, e.g., integration of nearest neighbors into…

Neighborly cubical polytopes exist: for any $n\ge d\ge 2r+2$, there is a cubical convex d-polytope $C^n_d$ whose $r$-skeleton is combinatorially equivalent to that of the $n$-dimensional cube. This solves a problem of Babson, Billera &…

Local topological charge structure in the 2D CP(N-1) sigma models is studied using the overlap Dirac operator. Long-range coherence of topological charge along locally 1D regions in 2D space-time is observed. We discuss the connection…

Let $G$ be a graph and $T$ a certain connected subgraph of $G$. The $T$-structure connectivity $\kappa(G; T)$ (or resp., $T$-substructure connectivity $\kappa^{s}(G; T)$) of $G$ is the minimum number of a set of subgraphs…

Last decade, numerous giant data center networks are built to provide increasingly fashionable web applications. For two integers $m\geq 0$ and $n\geq 2$, the $m$-dimensional DCell network with $n$-port switches $D_{m,n}$ and…

As a generalization of vertex connectivity, for connected graphs $G$ and $T$, the $T$-structure connectivity $\kappa(G, T)$ (resp. $T$-substructure connectivity $\kappa^{s}(G, T)$) of $G$ is the minimum cardinality of a set of subgraphs $F$…

The phenomenon of mutual coupling in continuous aperture arrays (CAPAs) is studied. First, a general physical model for the phenomenon that accounts for both polarization and surface dissipation losses is developed. Then, the unipolarized…

Mesh is a powerful data structure for 3D shapes. Representation learning for 3D meshes is important in many computer vision and graphics applications. The recent success of convolutional neural networks (CNNs) for structured data (e.g.,…

In this paper we consider a transformation which converts uncorrelated networks to correlated ones(here by correlation we mean that coordination numbers of two neighbors are not independent). We show that this transformation, which converts…

If $(\omega(e))$ is a family of random variables (weights) assigned to the edges of $\mathbb{Z}^d$, the nearest neighbor graph is the directed graph induced by all edges $\langle x,y \rangle$ such that $\omega(\{x,y\})$ is minimal among all…

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…

Let $G$ be a nontrivial connected graph of order $n$ and let $k$ be an integer with $2\leq k\leq n$. For a set $S$ of $k$ vertices of $G$, let $\kappa (S)$ denote the maximum number $\ell$ of edge-disjoint trees $T_1,T_2,...,T_\ell$ in $G$…

The generalized connectivity of a graph $G$ was introduced by Chartrand et al. Let $S$ be a nonempty set of vertices of $G$, and $\kappa(S)$ be defined as the largest number of internally disjoint trees $T_1, T_2, \cdots, T_k$ connecting…