Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Zongpeng Ding"'
Autor:
Zongpeng Ding
Publikováno v:
AIMS Mathematics, Vol 8, Iss 10, Pp 23989-23996 (2023)
The skewness of a graph $ G $, $ sk(G) $, is the smallest number of edges that need to be removed from $ G $ to make it planar. The crossing number of a graph $ G $, $ cr(G) $, is the minimum number of crossings over all possible drawings of $ G $. T
Externí odkaz:
https://doaj.org/article/f8ec0b0a46ed48a0a33c8d5b1253794b
Autor:
Zongpeng Ding, Xiaomei Qian
Publikováno v:
Mathematics, Vol 11, Iss 10, p 2253 (2023)
The crossing number of a graph G, cr(G), is defined as the smallest possible number of edge-crossings in a drawing of G in the plane. There are almost no results concerning crossing number of join of a disconnected 6-vertex graph with cycle. The main
Externí odkaz:
https://doaj.org/article/12b8567307414a998efc7e9f2debfb1a
Autor:
Zongpeng Ding, Yuanqiu Huang
Publikováno v:
Graphs and Combinatorics. 37:2351-2363
The crossing number of a graph G, denoted by cr(G), is defined as the smallest possible number of edge-crossings in a drawing of G in the plane. The cone CG, obtained from G by adding a new vertex adjacent to all the vertices in G. Let $$\phi _\mathr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::15d0f33edff99991b186c8ffcefc73d2
https://doi.org/10.1007/s00373-021-02361-2
https://doi.org/10.1007/s00373-021-02361-2
Autor:
Zongpeng Ding
Publikováno v:
Bulletin of the Malaysian Mathematical Sciences Society. 43:4183-4196
Computing the crossing number of a graph is NP-hard. In the paper, for a disconnected 6-vertex graph $$Q =C_{5}\cup K_{1}$$ , we obtain the crossing number $$Z(6,n)+\lfloor \frac{n}{2}\rfloor $$ of the graph $$Q_{n}$$ which is the join product of Q w
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cc1cf10cfcc12078ebe08ba01a7df423
https://doi.org/10.1007/s40840-020-00916-9
https://doi.org/10.1007/s40840-020-00916-9
Autor:
Shuangshou Wang, Wenzhi Li, Zhihong Yuan, Qiwen Jin, Zongpeng Ding, Xiaomeng Liu, Mingfu Ye, Jing Gu, Tingxuan Yan, Hongmei Chen, Yang Chen
Publikováno v:
Analytica chimica acta. 1211
The existing strategies for the determination of synthetic food colorants (FCs) in manufactured foods are highly relied on specialized instruments and skilled personnel which are limited by the high technical threshold and instrumentation cost. Herei
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4fb0caf4ad516f4ede131d1f6b6ade93
https://pubmed.ncbi.nlm.nih.gov/35589223
https://pubmed.ncbi.nlm.nih.gov/35589223
Autor:
Shuangshou Wang, Haili Wang, Yuwen Ding, Wenzhi Li, Hongrui Gao, Zongpeng Ding, Peng Lin, Jing Gu, Mingfu Ye, Tingxuan Yan, Hongmei Chen, Jin Ye
Publikováno v:
SSRN Electronic Journal.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::edcadbd8f9b6e0322066d8270c01002a
https://doi.org/10.2139/ssrn.4164400
https://doi.org/10.2139/ssrn.4164400
Autor:
ZONGPENG DING1 dzppxl@163.com, YUANQIU HUANG1 hyqq@hunnu.edu.cn
Publikováno v:
Discussiones Mathematicae: Graph Theory. 2018, Vol. 38 Issue 4, p899-909. 11p. 6 Diagrams.
A graph $G$ is {$k$-crossing-critical} if $cr(G)\ge k$, but $cr(G\setminus e)
Comment: 10 pages, 2 figures
Comment: 10 pages, 2 figures
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c4291916c55805b7e1cfd281e1355c7b
