Zobrazeno 1 - 10
of 25
pro vyhledávání: '"Zhu, Wen-Han"'
A graph $G$ is $H$-saturated if $H$ is not a subgraph of $G$ but $H$ is a subgraph of $G + e$ for any edge $e$ in $\overline{G}$. The saturation number $sat(n,H)$ for a graph $H$ is the minimal number of edges in any $H$-saturated graph of order $n$.
Externí odkaz:
http://arxiv.org/abs/2408.11644
Let $H$ be a fixed graph, a graph G is $H$-saturated if it has no copy of $H$ in $G$, but the addition of any edge in $E(\overline G)$ to $G$ results in an $H$-subgraph. The saturation number sat$(n,H)$ is the minimum number of edges in an $H$-satura
Externí odkaz:
http://arxiv.org/abs/2408.06719
Let $H$ be a fixed graph. A graph $G$ is called {\it $H$-saturated} if $H$ is not a subgraph of $G$ but the addition of any missing edge to $G$ results in an $H$-subgraph. The {\it saturation number} of $H$, denoted $sat(n,H)$, is the minimum number
Externí odkaz:
http://arxiv.org/abs/2404.12204
Let $S\subseteq V(G)$ and $\pi_{G}(S)$ denote the maximum number $t$ of edge-disjoint paths $P_{1},P_{2},\ldots,P_{t}$ in a graph $G$ such that $V(P_{i})\cap V(P_{j})=S$ for any $i,j\in\{1,2,\ldots,t\}$ and $i\neq j$. If $S=V(G)$, then $\pi_{G}(S)$ i
Externí odkaz:
http://arxiv.org/abs/2401.13423
Publikováno v:
In Discrete Applied Mathematics 15 December 2024 358:404-416
Publikováno v:
In Discrete Applied Mathematics 15 November 2024 357:215-235
Publikováno v:
In Applied Mathematics and Computation 15 November 2023 457
Publikováno v:
In Applied Mathematics and Computation 1 January 2023 436
Publikováno v:
In Discrete Applied Mathematics 15 December 2022 322:203-209
Autor:
Huo, Wen-Yi, Wang, Shi-Qi, Zhu, Wen-Han, Zhang, Ze-Ling, Fang, Feng, Xie, Zong-Han, Jiang, Jian-Qing
Publikováno v:
Tungsten; June 2021, Vol. 3 Issue: 2 p161-180, 20p