Zobrazeno 1 - 9
of 9
pro vyhledávání: '"XUQING BAI"'
Publikováno v:
Behavioral Sciences, Vol 13, Iss 8, p 679 (2023)
In today’s information society, with the growing integration of the Internet into individuals’ lives, problematic Internet use (PIU) among adolescents has become more prevalent. Therefore, we conducted this study to investigate the correlation be
Externí odkaz:
https://doaj.org/article/9472779fda0c4bd59a8c195bb3128067
Publikováno v:
Behavioral Sciences, Vol 12, Iss 12, p 478 (2022)
Due to the prevalence and severe harm of adolescent tobacco and alcohol use, researchers have been paying attention to its influencing factors. From the perspective of the ecological techno-subsystem theory, this study aimed to examine the correlatio
Externí odkaz:
https://doaj.org/article/14e9a96c88744bb1a0513034ba2191ad
Autor:
XUQING BAI1 baixuqing0@163.com, RENYING CHANG1 changrysd@163.com, ZHONG HUANG1 2120150001@mail.nankai.edu.cn, XUELIANG LI1 lxl@nankai.edu.cn
Publikováno v:
Discussiones Mathematicae: Graph Theory. 2022, Vol. 42 Issue 4, p1185-1204. 20p.
Publikováno v:
Bulletin of the Malaysian Mathematical Sciences Society. 44:2465-2477
For an edge-colored graph $G$, a set $F$ of edges of $G$ is called a \emph{proper cut} if $F$ is an edge-cut of $G$ and any pair of adjacent edges in $F$ are assigned by different colors. An edge-colored graph is \emph{proper disconnected} if for eac
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3b674bff69f4fc4332d353c627f5f87a
https://doi.org/10.1007/s40840-020-01069-5
https://doi.org/10.1007/s40840-020-01069-5
Publikováno v:
International Journal of Environmental Research and Public Health; Volume 19; Issue 23; Pages: 15886
With the increasing prevalence of mobile phone addiction, mobile phone addiction has been considered a prominent risk factor for internalizing or externalizing problems, such as psychological distress and irrational procrastination. However, few stud
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ea35303bee3c37b3ae911921e3f142c4
https://doi.org/10.3390/ijerph192315886
https://doi.org/10.3390/ijerph192315886
Publikováno v:
Computer Science & Information Technology (CS & IT).
Let G be a nontrivial link-colored connected network. A link-cut R of G is called a rainbow link-cut if no two of its links are colored the same. A link-colored network G is rainbow disconnected if for every two nodes u and v of G, there exists a u-v
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ffefbcfe5894abdb5e983a9b8c790e88
https://doi.org/10.5121/csit.2021.111009
https://doi.org/10.5121/csit.2021.111009
Autor:
Xueliang Li, Xuqing Bai
Publikováno v:
Journal of Physics: Conference Series. 1828:012150
Let $G$ be a nontrivial edge-colored connected graph. An edge-cut $R$ of $G$ is called a {\it rainbow edge-cut} if no two edges of $R$ are colored with the same color. For two distinct vertices $u$ and $v$ of $G$, if an edge-cut separates them, then
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::10166fd3f5b542e8e5531eef5e6ab726
https://doi.org/10.1088/1742-6596/1828/1/012150
https://doi.org/10.1088/1742-6596/1828/1/012150
Publikováno v:
Discussiones Mathematicae Graph Theory. 42:1185
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cb8b941e3824d718992b83a626e07994
https://doi.org/10.7151/dmgt.2333
https://doi.org/10.7151/dmgt.2333
A set $B$ of vertices in a graph $G$ is called a \emph{$k$-limited packing} if for each vertex $v$ of $G$, its closed neighbourhood has at most $k$ vertices in $B$. The \emph{$k$-limited packing number} of a graph $G$, denoted by $L_k(G)$, is the lar
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4b308f0fac8a6b3d328bc05029e2320c
