Zobrazeno 1 - 10
of 24
pro vyhledávání: '"YANCAI ZHAO"'
Publikováno v:
Transactions on Combinatorics, Vol 5, Iss 3, Pp 1-9 (2016)
A set $S$ of vertices in a graph $G=(V,E)$ is called a total$k$-distance dominating set if every vertex in $V$ is withindistance $k$ of a vertex in $S$. A graph $G$ is total $k$-distancedomination-critical if $gamma_{t}^{k} (G - x) < gamma_{t}^{k}(G)
Externí odkaz:
https://doaj.org/article/fa700fb1a63a4cdd95d51aa044c792c0
Autor:
Yancai Zhao1,2, Zuosong Liang1,2
Publikováno v:
Advances & Applications in Discrete Mathematics. Jan2021, Vol. 26 Issue 1, p17-33. 17p.
Autor:
Zuosong Liang, Yancai Zhao
Publikováno v:
Advances and Applications in Discrete Mathematics. 26:17-33
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6c06e3e44a45fab50447312f935779e8
https://doi.org/10.17654/dm026010017
https://doi.org/10.17654/dm026010017
Publikováno v:
Graphs and Combinatorics. 37:445-454
A clique of a graph G is a set of pairwise adjacent vertices of G. A clique-coloring of G is an assignment of colors to the vertices of G in such a way that no inclusion-wise maximal clique of size at least two of G is monochromatic. An equitable cli
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d870855dfa24eda5445fc4c849697fe6
https://doi.org/10.1007/s00373-020-02253-x
https://doi.org/10.1007/s00373-020-02253-x
Publikováno v:
International Journal of Finance & Economics. 26:2134-2141
In this study, we investigate the different spillover levels of economic policy uncertainty (EPU) on the oil, gold, and stock markets in China. EPU has the highest levels of the growth and volatility spillover on the gold market, and EPU transmits th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d5bf48cae984f1d2611307c31e6ffd36
https://doi.org/10.1002/ijfe.1898
https://doi.org/10.1002/ijfe.1898
Autor:
HAICHAO WANG1 whchao2000@163.com, YANCAI ZHAO2 zhaoyc69@126.com, YUNPING DENG1 dyp612@163.com
Publikováno v:
Discussiones Mathematicae: Graph Theory. 2018, Vol. 38 Issue 2, p385-396. 12p.
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 38, Iss 2, Pp 385-396 (2018)
A dominating set of a graph G is a subset D ⊆ V (G) such that every vertex not in D is adjacent to at least one vertex in D. A dominating set S of G is called a secure dominating set if each vertex u ∈ V (G) \ S has one neighbor v in S such that
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::48ab24b2ddfa2ebf8dbc061f95eccc37
https://doaj.org/article/997eef850ecb444c8029e575291b208d
https://doaj.org/article/997eef850ecb444c8029e575291b208d
Publikováno v:
Journal of Combinatorial Designs. 25:349-380
The study of optical orthogonal codes has been motivated by an application in an optical code-division multiple access system. From a practical point of view, compared to one-dimensional optical orthogonal codes, two-dimensional optical orthogonal co
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8fe02b105fb44cd71258622b3a1a52a3
https://doi.org/10.1002/jcd.21554
https://doi.org/10.1002/jcd.21554
Publikováno v:
Advances in Intelligent Systems and Computing ISBN: 9783030027766
Given two real numbers \(b\ge a>0\), an (a, b)-Roman dominating function on a graph \(G=(V,E)\) is a function \(f:V\rightarrow \{0,a,b\}\) satisfying the condition that every vertex v for which \(f(v)=0\) is adjacent to a vertex u for which \(f(u)=b\
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::53387e5c961bfb74857e9d8ad55597f5
https://doi.org/10.1007/978-3-030-02777-3_18
https://doi.org/10.1007/978-3-030-02777-3_18
Autor:
YANCAI ZHAO1 zhaoyc69@126.com, ERFANG SHAN2 efshan@shu.edu.cn, ZUOSONG LIANG3 shuxueyunchou@163.com, RUZHAO GAO4 gaoruzhao781127@sina.com
Publikováno v:
Bulletin of the Malaysian Mathematical Sciences Society. 2014, Vol. 37 Issue 4, p965-970. 6p.