相关论文: Structure and substructure connectivity of balance…

Let $\Lambda(T)$ denote the set of leaves in a tree $T$. One natural problem is to look for a spanning tree $T$ of a given graph $G$ such that $\Lambda(T)$ is as large as possible. This problem is called maximum leaf number, and it is a…

For two integers $r\geq 2$ and $h\geq 0$, the \emph{$h$-extra $r$-component connectivity} $\kappa^h_r(G)$ of a graph $G$ is defined to be the minimum size of a subset of vertices whose removal disconnects $G$, and there are at least $r$…

Signed networks have been a topic of recent interest in the network control community as they allow studying antagonistic interactions in multi-agent systems. Although dynamical characteristics of signed networks have been well-studied,…

Let $H$ and $G$ be graphs such that $H$ has at least 3 vertices and is connected. The $H$-line graph of $G$, denoted by $HL(G)$, is that graph whose vertices are the edges of $G$ and where two vertices of $HL(G)$ are adjacent if they are…

The direct product of graphs $G=(V(G),E(G))$ and $H=(V(H),E(H))$ is the graph, denoted as $G\times H$, with vertex set $V(G\times H)=V(G)\times V(H)$, where vertices $(x_1,y_1)$ and $(x_2,y_2)$ are adjacent in $G\times H$ if $x_1x_2\in…

Let $\mathcal{H}=\{H_i: i<\alpha \}$ be an indexed family of graphs for some ordinal number $\alpha$. $\mathcal{H}$-decomposition of a graph $G$ is a family $\mathcal{G}=\{G_i: i<\alpha \}$ of edge-disjoint subgraphs of $G$ such that $G_i$…

We prove that: I. If $L$ is a $T_1$ space, $|L|>1$ and $d(L) \leq \kappa \geq \omega$, then there is a submaximal dense subspace $X$ of $L^{2^\kappa}$ such that $|X|=\Delta(X)=\kappa$; II. If $\frak{c}\leq\kappa=\kappa^\omega<\lambda$ and…

Persistent homology is a mathematical tool used for studying the shape of data by extracting its topological features. It has gained popularity in network science due to its applicability in various network mining problems, including…

The generalized $k$-connectivity $\kappa_k(G)$ of a graph $G$, introduced by Hager in 1985, is a nice generalization of the classical connectivity. Recently, as a natural counterpart, we proposed the concept of generalized…

Boolean satisfiability problems are an important benchmark for questions about complexity, algorithms, heuristics and threshold phenomena. Recent work on heuristics, and the satisfiability threshold has centered around the structure and…

Consider a graph $\Gamma$. A set $ S $ of vertices in $\Gamma$ is called a {cyclic vertex cutset} of $\Gamma$ if $\Gamma - S$ is disconnected and has at least two components containing cycles. If $\Gamma$ has a cyclic vertex cutset, then it…

The data center networks $D_{n,k}$, proposed in 2008, has many desirable features such as high network capacity. A kind of generalization of diagnosability for network $G$ is $g$-good-neighbor diagnosability which is denoted by $t_g(G)$.…

The basic goal of survivable network design is to construct low-cost networks which preserve a sufficient level of connectivity despite the failure or removal of a few nodes or edges. One of the most basic problems in this area is the…

The \textit{longest path transversal number} of a connected graph $G$, denoted by $lpt(G)$, is the minimum size of a set of vertices of $G$ that intersects all longest paths in $G$. We present constant upper bounds for the longest path…

Traditional graph centrality measures effectively quantify node importance but fail to capture the structural uniqueness of multi-scale connectivity patterns -- critical for understanding network resilience and function. This paper…

Hypergraphs provide a natural way to represent polyadic relationships in network data. For large hypergraphs, it is often difficult to visually detect structures within the data. Recently, a scalable polygon-based visualization approach was…

Interconnected networks describe the dynamics of important systems in a wide range such as biological systems and electrical power grids. Some important features of these systems were successfully studied and understood through simplified…

A structure is called homogeneous if every isomorphism between finitely induced substructures of the structure extends to an automorphism of the structure. Recently, P. J. Cameron and J. Ne\v{s}et\v{r}il introduced a relaxed version of…

The conditional $h$-vertex($h$-edge) connectivity of a connected graph $H$ of minimum degree $ k > h$ is the size of a smallest vertex(edge) set $F$ of $H$ such that $H - F$ is a disconnected graph of minimum degree at least $h.$ Let $G$ be…

Let $G$ be a graph on $n$ vertices, $p$ the order of a longest path and $\kappa$ the connectivity of $G$. In 1989, Bauer, Broersma Li and Veldman proved that if $G$ is a 2-connected graph with $d(x)+d(y)+d(z)\ge n+\kappa$ for all triples…