default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDZhao Wang 0007
Person information
- affiliation: China Jiliang University, College of Science, Hangzhou, China
Other persons with the same name
- Zhao Wang — disambiguation page
- Zhao Wang 0001 — Xi'an Jiaotong-Liverpool University, Department of Electrical and Electronic Engineering, Suzhou, China (and 1 more)
- Zhao Wang 0002
![[0000-0002-6863-7695]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0002-6863-7695")
— Royal Institute of Technology, School of Electrical Engineering, Department of Communication Theory, Stockholm, Sweden - Zhao Wang 0003 — Massachusetts Institute of Technology, Cambridge, MA, USA (and 1 more)
- Zhao Wang 0004 — Peking University, Institute of Digital Media, Beijing, China (and 1 more)
- Zhao Wang 0005 — Hubei University, Faculty of Physics and Electronic Sciences, Wuhan, China
- Zhao Wang 0006 — Zhejiang University, College of Information Science and Electronic Engineering, Hangzhou, Zhejiang, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j25]Zhao Wang, Yaping Mao, Sun-Yuan Hsieh, Ralf Klasing, Yuzhi Xiao:
The g-extra connectivity of graph products. J. Comput. Syst. Sci. 145: 103552 (2024)- 2023
- [j24]Yaping Mao, Zhao Wang, Colton Magnant, Ingo Schiermeyer:
Gallai-Ramsey numbers for fans. Discret. Math. 346(5): 113338 (2023) - [j23]Jinyu Zou, Zhao Wang, Hong-Jian Lai, Yaping Mao:
Gallai-Ramsey Numbers Involving a Rainbow 4-Path. Graphs Comb. 39(3): 54 (2023) - [j22]Yaping Mao, Kenta Ozeki, Aaron Robertson, Zhao Wang:
Arithmetic progressions, quasi progressions, and Gallai-Ramsey colorings. J. Comb. Theory A 193: 105672 (2023) - 2022
- [j21]Jinyu Zou, Yaping Mao, Zhao Wang, Eddie Cheng:
Fractional matching preclusion number of graphs. Discret. Appl. Math. 311: 142-153 (2022) - [j20]Yaping Mao, Zhao Wang, Colton Magnant, Ingo Schiermeyer:
Ramsey and Gallai-Ramsey Number for Wheels. Graphs Comb. 38(2): 42 (2022) - [j19]Zhao Wang, Yaping Mao, Yue Li, Boris Furtula:
On relations between Sombor and other degree-based indices. J. Appl. Math. Comput. 68(1): 1-17 (2022) - 2021
- [j18]Yaping Mao, Peter Dankelmann, Zhao Wang:
Steiner diameter, maximum degree and size of a graph. Discret. Math. 344(8): 112468 (2021) - [j17]Zhao Wang, Yaping Mao, Colton Magnant, Jinyu Zou:
Ramsey and Gallai-Ramsey Numbers for Two Classes of Unicyclic Graphs. Graphs Comb. 37(1): 337-354 (2021) - [j16]Nan Jia, Yaping Mao, Zhao Wang, Eddie Cheng:
Linear k-arboricity of Caylay Graphs on Abelian Groups with Given Degree. Math. Comput. Sci. 15(4): 743-755 (2021) - 2020
- [j15]Yaping Mao, Zhao Wang, Colton Magnant, Ingo Schiermeyer:
Ramsey and Gallai-Ramsey numbers for stars with extra independent edges. Discret. Appl. Math. 285: 153-172 (2020) - [j14]Zhao Wang, Yaping Mao, Kinkar Chandra Das, Yilun Shang:
Nordhaus-Gaddum-Type Results for the Steiner Gutman Index of Graphs. Symmetry 12(10): 1711 (2020) - [j13]Zhao Wang, Yaping Mao, Sun-Yuan Hsieh, Jichang Wu:
On the g-good-neighbor connectivity of graphs. Theor. Comput. Sci. 804: 139-148 (2020)
2010 – 2019
- 2019
- [j12]Jinyu Zou, Yaping Mao, Colton Magnant, Zhao Wang, Chengfu Ye:
Gallai-Ramsey numbers for books. Discret. Appl. Math. 268: 164-177 (2019) - [j11]Zhao Wang, Yaping Mao, Christopher Melekian, Eddie Cheng:
Steiner Distance in Join, Corona, Cluster, and Threshold Graphs. J. Inf. Sci. Eng. 35(4): 721-735 (2019) - [j10]Zhao Wang, Christopher Melekian, Eddie Cheng, Yaping Mao:
Matching preclusion number in product graphs. Theor. Comput. Sci. 755: 38-47 (2019) - [j9]Zhao Wang, Yaping Mao, Eddie Cheng, Jinyu Zou:
Matching preclusion number of graphs. Theor. Comput. Sci. 759: 61-71 (2019) - 2018
- [j8]Yaping Mao, Eddie Cheng, Zhao Wang, Zhiwei Guo:
The k-independence number of graph products. Art Discret. Appl. Math. 1(1): #P1.01 (2018) - [j7]Yaping Mao, Eddie Cheng, Zhao Wang:
Steiner Distance in Product Networks. Discret. Math. Theor. Comput. Sci. 20(2) (2018) - [j6]Zhao Wang, Yaping Mao, Hengzhe Li, Chengfu Ye:
On the Steiner 4-Diameter of Graphs. J. Interconnect. Networks 18(1): 1850002:1-1850002:15 (2018) - [j5]Yaping Mao, Zhao Wang, Eddie Cheng, Christopher Melekian:
Strong matching preclusion number of graphs. Theor. Comput. Sci. 713: 11-20 (2018) - 2017
- [j4]Yaping Mao, Zhao Wang, Ivan Gutman, He Li:
Nordhaus-Gaddum-type results for the Steiner Wiener index of graphs. Discret. Appl. Math. 219: 167-175 (2017) - [j3]Zhao Wang, Yaping Mao, Chengfu Ye, Haixing Zhao:
Super Edge-Connectivity of Strong Product Graphs. J. Interconnect. Networks 17(2): 1750007:1-1750007:14 (2017) - [c1]Zhao Wang, Yaping Mao, Christopher Melekian, Eddie Cheng:
Steiner Distance in Join, Corona and Threshold Graphs. ISPAN-FCST-ISCC 2017: 100-104 - 2016
- [j2]Yaping Mao, Zhao Wang, Fengnan Yanling, Chengfu Ye:
Monochromatic connectivity and graph products. Discret. Math. Algorithms Appl. 8(1): 1650011:1-1650011:18 (2016) - [j1]Yaping Mao, Fengnan Yanling, Zhao Wang, Chengfu Ye:
Rainbow vertex-connection and graph products. Int. J. Comput. Math. 93(7): 1078-1092 (2016)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-18 21:50 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
