Zobrazeno 1 - 10
of 502
pro vyhledávání: '"Zhang, Shenggui"'
We say that a graph $G$ on $n$ vertices is $\{H,F\}$-$o$-heavy if every induced subgraph of $G$ isomorphic to $H$ or $F$ contains two nonadjacent vertices with degree sum at least $n$. Generalizing earlier sufficient forbidden subgraph conditions for
Externí odkaz:
http://arxiv.org/abs/2409.13491
An edge-colored graph $G$ is called properly colored if every two adjacent edges are assigned different colors. A monochromatic triangle is a cycle of length 3 with all the edges having the same color. Given a tree $T_0$, let $\mathcal{T}(n,T_0)$ be
Externí odkaz:
http://arxiv.org/abs/2403.09082
This paper presents the following research findings on Boolean networks (BNs) and their dual subspaces.First, we establish a bijection between the dual subspaces of a BN and the partitions of its state set. Furthermore, we demonstrate that a dual sub
Externí odkaz:
http://arxiv.org/abs/2301.10961
An edge-colored graph is called rainbow if all the colors on its edges are distinct. Given a positive integer n and a graph G, the anti-Ramsey number ar(n,G) is the maximum number of colors in an edge-coloring of K_{n} with no rainbow copy of G. Deno
Externí odkaz:
http://arxiv.org/abs/2201.03424
Let $G$ be an edge-colored graph on $n$ vertices. The minimum color degree of $G$, denoted by $\delta^c(G)$, is defined as the minimum number of colors assigned to the edges incident to a vertex in $G$. In 2013, H. Li proved that an edge-colored grap
Externí odkaz:
http://arxiv.org/abs/2112.14458
Publikováno v:
In Linear Algebra and Its Applications 15 December 2024 703:289-301
Publikováno v:
In LWT 1 December 2024 213
Publikováno v:
In Discrete Mathematics July 2024 347(7)
Publikováno v:
In Microchemical Journal June 2024 201
Publikováno v:
In Information Sciences June 2024 671