Zobrazeno 1 - 10
of 427
pro vyhledávání: '"Zhang Xinhong"'
Publikováno v:
Open Mathematics, Vol 19, Iss 1, Pp 483-491 (2021)
In 2011, Factor and Merz [Discrete Appl. Math. 159 (2011), 100–103] defined the (1,2)\left(1,2)-step competition graph of a digraph. Given a digraph D=(V,A)D=\left(V,A), the (1,2)\left(1,2)-step competition graph of D, denoted C1,2(D){C}_{1,2}\left
Externí odkaz:
https://doaj.org/article/ef6a01dc546e400e873d50ec21b21afe
Publikováno v:
Open Mathematics, Vol 19, Iss 1, Pp 268-283 (2021)
In 2018, Bai, Fujita and Zhang [Discrete Math. 341 (2018), no. 6, 1523–1533] introduced the concept of a kernel by rainbow paths (for short, RP-kernel) of an arc-coloured digraph DD, which is a subset SS of vertices of DD such that (aa) there exist
Externí odkaz:
https://doaj.org/article/f3ab52f3569c406c930f0de214d8f182
Publikováno v:
Open Mathematics, Vol 21, Iss 1, Pp 126662-1586 (2023)
Let D=(V,A)D=\left(V,A) be a simple digraph with vertex set VV, arc set AA, and no isolated vertex. A total Roman dominating function (TRDF) of DD is a function h:V→{0,1,2}h:V\to \left\{0,1,2\right\}, which satisfies that each vertex x∈Vx\in V wi
Externí odkaz:
https://doaj.org/article/cf978781f0cf499fae648a4d5b6c53d5
Publikováno v:
中西医结合护理, Vol 7, Iss 7, Pp 48-50 (2021)
Objective To explore the effect of Traditional Chinese Medicine (TCM) nursing management for rheumatoid arthritis patients with damp-heat arthralgia spasm syndrome. Methods A total of 398 hospitalized patients with rheumatoid arthritis of damp-heat a
Externí odkaz:
https://doaj.org/article/4d73e91d23094e099ef355e35dd8cc63
Publikováno v:
Open Mathematics, Vol 18, Iss 1, Pp 1625-1634 (2020)
The concept of the domination number plays an important role in both theory and applications of digraphs. Let D=(V,A)D=(V,A) be a digraph. A vertex subset T⊆V(D)T\subseteq V(D) is called a dominating set of D, if there is a vertex t∈Tt\in T such
Externí odkaz:
https://doaj.org/article/8bd95bea726f41898d5bb0515e3f92b5
Autor:
Zhang Xinhong, Li Ruijuan
Publikováno v:
Open Mathematics, Vol 18, Iss 1, Pp 771-780 (2020)
Let G be a Hamiltonian graph. A nonempty vertex set X⊆V(G)X\subseteq V(G) is called a Hamiltonian cycle enforcing set (in short, an H-force set) of G if every X-cycle of G (i.e., a cycle of G containing all vertices of X) is a Hamiltonian cycle. Fo
Externí odkaz:
https://doaj.org/article/c1552aa890cf4d8faa5b41b1a7c63929
Autor:
Zhao, Zhuoying, Zhang, Xinhong
Publikováno v:
In Chaos, Solitons and Fractals: the interdisciplinary journal of Nonlinear Science, and Nonequilibrium and Complex Phenomena February 2025 191
Publikováno v:
In Chaos, Solitons and Fractals: the interdisciplinary journal of Nonlinear Science, and Nonequilibrium and Complex Phenomena September 2024 186
Publikováno v:
In Computers in Biology and Medicine July 2024 177