Zhao Wang

Orcid: 0000-0003-3888-2486

Affiliations:

China Jiliang University, College of Science, Hangzhou, China

According to our database¹, Zhao Wang authored at least 30 papers between 2016 and 2026.

Collaborative distances:

Dijkstra number² of five.
Erdős number³ of three.

Timeline

Legend:

Book In proceedings Article PhD thesis Dataset Other

Links

On csauthors.net:

Bibliography

2026

The g-good-neighbor diagnosability of lexicographic product networks under the PMC model.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2026

On the g-extra connectivity of graphs.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2026

2025

The <i>g</i>-good-neighbor diagnosability of product networks under the PMC model.

[BibT_eX]

[DOI]

CoRR, March, 2025

The g-good-neighbor diagnosability of product networks under the PMC model.

[BibT_eX]

[DOI]

Inf. Comput., 2025

2024

The g-extra connectivity of graph products.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2024

2023

Gallai-Ramsey Numbers Involving a Rainbow 4-Path.

[BibT_eX]

[DOI]

Graphs Comb., June, 2023

Gallai-Ramsey numbers for fans.

[BibT_eX]

[DOI]

Discret. Math., May, 2023

Arithmetic progressions, quasi progressions, and Gallai-Ramsey colorings.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2023

2022

On relations between Sombor and other degree-based indices.

[BibT_eX]

[DOI]

J. Appl. Math. Comput., February, 2022

Ramsey and Gallai-Ramsey Number for Wheels.

[BibT_eX]

[DOI]

Graphs Comb., 2022

Fractional matching preclusion number of graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2022

2021

Linear k-arboricity of Caylay Graphs on Abelian Groups with Given Degree.

[BibT_eX]

[DOI]

Math. Comput. Sci., 2021

Ramsey and Gallai-Ramsey Numbers for Two Classes of Unicyclic Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2021

Steiner diameter, maximum degree and size of a graph.

[BibT_eX]

[DOI]

Yaping Mao

Peter Dankelmann

Zhao Wang

Discret. Math., 2021

2020

On the <i>g</i>-good-neighbor connectivity of graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Nordhaus-Gaddum-Type Results for the Steiner Gutman Index of Graphs.

[BibT_eX]

[DOI]

Symmetry, 2020

Ramsey and Gallai-Ramsey numbers for stars with extra independent edges.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2020

2019

Matching preclusion number of graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Matching preclusion number in product graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Steiner Distance in Join, Corona, Cluster, and Threshold Graphs.

[BibT_eX]

[DOI]

J. Inf. Sci. Eng., 2019

Gallai-Ramsey numbers for books.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2019

2018

Strong matching preclusion number of graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2018

On the Steiner 4-Diameter of Graphs.

[BibT_eX]

[DOI]

J. Interconnect. Networks, 2018

Steiner Distance in Product Networks.

[BibT_eX]

[DOI]

Yaping Mao

Eddie Cheng

Zhao Wang

Discret. Math. Theor. Comput. Sci., 2018

The k-independence number of graph products.

[BibT_eX]

[DOI]

Art Discret. Appl. Math., 2018

2017

Super Edge-Connectivity of Strong Product Graphs.

[BibT_eX]

[DOI]

J. Interconnect. Networks, 2017

Nordhaus-Gaddum-type results for the Steiner Wiener index of graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2017

Steiner Distance in Join, Corona and Threshold Graphs.

[BibT_eX]

[DOI]

Proceedings of the 14th International Symposium on Pervasive Systems, 2017

2016

Rainbow vertex-connection and graph products.

[BibT_eX]

[DOI]

Int. J. Comput. Math., 2016

Monochromatic connectivity and graph products.

[BibT_eX]

[DOI]

Discret. Math. Algorithms Appl., 2016

Zhao Wang

Timeline

Legend:

Links

On csauthors.net:

Bibliography

Loading...