Zhao Wang

activity

20152026

most citedSteiner Distance in Product Networks

17 citations · 53 across the 25 of their papers we have counts for

collaborators

26 papers

math.CO2026

Solution to a conjecture of Alon, Dębski, Grytczuk and Przybyło on fixed-cardinality arithmetic progressions

Yaping Mao, Zhao Wang, Meiqin Wei +1

Fix a positive integer $n$ , and put $B_{d} = {d, 2 d, \dots, n d}$ . Let $M_{k} (n)$ be the least integer $m$ for which one translate of each of $B_{1}, \dots, B_{k}$ can be placed pairwise disjo…

math.CO2025

Ramsey numbers for partially-ordered sets

Gyula O. H. Katona, Yaping Mao, Kenta Ozeki +1

We say that a poset $Q$ contains a copy (resp.~an induced copy) of a poset $P$ if there is an injection $f : P \to Q$ such that for any $x, y \in P$ , $f (x) \leq f (y)$ in $Q$ if (resp…

cs.DM2025

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

Zhao Wang, Yaping Mao, Sun-Yuan Hsieh +1

The concept of neighbor connectivity originated from the assessment of the subversion of espionage networks caused by underground resistance movements, and it has now been applied…

math.CO2023★ 1 cited

Constructing edge-disjoint Steiner trees in Cartesian product networks

Rui Li, Gregory Gutin, He Zhang +3

Cartesian product networks are always regarded as a tool for ``combining'' two given networks with established properties to obtain a new one that inherits properties from both. Fo…

math.CO2022★ 2 cited

Euclidean Gallai-Ramsey Theory

Yaping Mao, Kenta Oeki, Zhao Wang

In this paper, we introduce Euclidean Gallai-Ramsey theory, by combining Euclidean Ramsey theory and Gallai-Ramsey theory on graphs. More precisely, we consider the following probl…

math.CO2022

Some multivariable Rado numbers

Gang Yang, Yaping Mao, Changxiang He +1

The Rado number of an equation is a Ramsey-theoretic quantity associated to the equation. Let $E$ be a linear equation. Denote by $R_{r} (E)$ the mi…

math.CO2021★ 1 cited

Gallai-Ramsey numbers involving a rainbow $4$ -path

Jinyu Zou, Zhao Wang, Hong-Jian Lai +1

Given two non-empty graphs $G, H$ and a positive integer $k$ , the Gallai-Ramsey number $gr_{k} (G : H)$ is defined as the minimum integer $N$ such that for all $n \geq N$ ,…

math.CO2020

Gallai-Ramsey number for the union of stars

Yaping Mao, Zhao Wang, Colton Magnant +1

Given a graph $G$ and a positive integer $k$ , define the \emph{Gallai-Ramsey number} to be the minimum number of vertices $n$ such that any $k$ -edge coloring of the complete graph…

math.CO2020★ 1 cited

Bounds for Gallai-Ramsey functions and numbers

Zhao Wang, Yaping Mao, Ran Gu +2

For two graphs $G, H$ and a positive integer $k$ , the \emph{Gallai-Ramsey number} $gr_{k} (G, H)$ is defined as the minimum number of vertices $n$ such that any $k$ -edge-…

math.CO2020★ 1 cited

Gallai Ramsey number for double stars

Gyula O. H. Katona, Colton Magnant, Yaping Mao +1

Given a graph $G$ and a positive integer $k$ , the \emph{Gallai-Ramsey number} is defined to be the minimum number of vertices $n$ such that any $k$ -edge coloring of $K_{n}$ contains…

math.CO2019

Fractional matching preclusion number of graphs

Jinyu Zou, Yaping Mao, Zhao Wang +1

The \emph{fractional matching preclusion number} of a graph $G$ , denoted by $f m p (G)$ , is the minimum number of edges whose deletion results in a graph that has no fractional perfec…

math.CO2019

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

Yaping Mao, Zhao Wang, Colton Magnant +1

Given a graph $G$ and a positive integer $k$ , define the \emph{Gallai-Ramsey number} to be the minimum number of vertices $n$ such that any $k$ -edge coloring of $K_{n}$ contains eith…

math.CO2019★ 4 cited

Ramsey and Gallai-Ramsey number for wheels

Yaping Mao, Zhao Wang, Colton Magnant +1

Given a graph $G$ and a positive integer $k$ , define the \emph{Gallai-Ramsey number} to be the minimum number of vertices $n$ such that any $k$ -edge coloring of $K_{n}$ contains eith…

math.CO2019

On the $g$ -good-neighbor connectivity of graphs

Zhao Wang, Yaping Mao, Sun-Yuan Hsieh +1

Connectivity and diagnosability are two important parameters for the fault tolerant of an interconnection network $G$ . In 1996, Fàbrega and Fiol proposed the $g$ -good-neighbor conn…

math.CO2019★ 2 cited

On the $g$ -extra connectivity of graphs

Zhao Wang, Yaping Mao, Sun-Yuan Hsieh

Connectivity and diagnosability are two important parameters for the fault tolerant of an interconnection network $G$ . In 1996, Fàbrega and Fiol proposed the $g$ -extra connectivity…

math.CO2019★ 5 cited

Gallai-Ramsey numbers for fans

Yaping Mao, Zhao Wang, Colton Magnant +1

Given a graph $G$ and a positive integer $k$ , define the \emph{Gallai-Ramsey number} to be the minimum number of vertices $n$ such that any $k$ -edge coloring of $K_{n}$ contains eith…

math.CO2018★ 5 cited

Ramsey and Gallai-Ramsey numbers for two classes of unicyclic graphs

Zhao Wang, Yaping Mao, Colton Magnant +1

Given a graph $G$ and a positive integer $k$ , define the \emph{Gallai-Ramsey number} to be the minimum number of vertices $n$ such that any $k$ -edge coloring of $K_{n}$ contains eith…

math.CO2018

Matching preclusion number of graphs

Zhao Wang, Yaping Mao, Eddie Cheng +1

The \emph{matching preclusion number} of a graph $G$ , denoted by $\mpo(G)$, is the minimum number of edges whose deletion results in a graph that has neither perfect matchings nor…

math.CO2018★ 7 cited

Gallai-Ramsey numbers of odd cycles

Zhao Wang, Yaping Mao, Colton Magnant +2

Given two graphs $G$ and $H$ and a positive integer $k$ , the $k$ -color Gallai-Ramsey number, denoted by $g r_{k} (G : H)$ , is the minimum integer $N$ such that for all $n \geq N$ , ev…

math.CO2018

Gallai-Ramsey numbers for books

Jinyu Zou, Yaping Mao, Colton Magnant +2

Given a graph $G$ and a positive integer $k$ , the \emph{Gallai-Ramsey number} is defined to be the minimum number of vertices $n$ such that any $k$ -edge coloring of $K_{n}$ contains…

math.CO2017

Steiner diameter, maximum degree and size of a graph

Yaping Mao, Zhao Wang

The Steiner diameter $s d ia m_{k} (G)$ of a graph $G$ , introduced by Chartrand, Oellermann, Tian and Zou in 1989, is a natural generalization of the concept of classical diameter. When…

math.CO2017★ 17 cited

Steiner Distance in Product Networks

Yaping Mao, Eddie Cheng, Zhao Wang

For a connected graph $G$ of order at least $2$ and $S \subseteq V (G)$ , the \emph{Steiner distance} $d_{G} (S)$ among the vertices of $S$ is the minimum size among all connected subgra…

math.CO2017★ 3 cited

The Steiner 4-diameter of a graph

Zhao Wang, Yaping Mao, Hengzhe Li +1

The Steiner distance of a graph, introduced by Chartrand, Oellermann, Tian and Zou in 1989, is a natural generalization of the concept of classical graph distance. For a connected…

math.CO2015★ 1 cited

Interval minors of complete multipartite graphs

Yaping Mao, Hongjian Lai, Zhao Wang +1

Interval minors of bipartite graphs were introduced by Jacob Fox in the study of Stanley-Wilf limits. Recently, Mohar, Rafiey, Tayfeh-Rezaie and Wu investigated the maximum number…

Solution to a conjecture of Alon, Dębski, Grytczuk and Przybyło on fixed-cardinality arithmetic progressions

Ramsey numbers for partially-ordered sets

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

Constructing edge-disjoint Steiner trees in Cartesian product networks

Euclidean Gallai-Ramsey Theory

Some multivariable Rado numbers

Gallai-Ramsey numbers involving a rainbow 4-path

Gallai-Ramsey number for the union of stars

Bounds for Gallai-Ramsey functions and numbers

Gallai Ramsey number for double stars

Fractional matching preclusion number of graphs

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

Ramsey and Gallai-Ramsey number for wheels

On the g-good-neighbor connectivity of graphs

On the g-extra connectivity of graphs

Gallai-Ramsey numbers for fans

Ramsey and Gallai-Ramsey numbers for two classes of unicyclic graphs

Matching preclusion number of graphs

Gallai-Ramsey numbers of odd cycles

Gallai-Ramsey numbers for books

Steiner diameter, maximum degree and size of a graph

Steiner Distance in Product Networks

The Steiner 4-diameter of a graph

Interval minors of complete multipartite graphs

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

Gallai-Ramsey numbers involving a rainbow $4$ -path

On the $g$ -good-neighbor connectivity of graphs

On the $g$ -extra connectivity of graphs