3 citations · 6 across the 4 of their papers we have counts for
5 papers · 1 filter
The g-extra connectivity of the Mycielskian
He Li, Shumin Zhang, Chengfu Ye
The -extra connectivity is an important parameter to measure the ability of tolerance and reliability of interconnection networks. Given a connected graph and a non-ne…
Gallai-Ramsey numbers for books
Jinyu Zou, Yaping Mao, Colton Magnant +2
Given a graph and a positive integer , the \emph{Gallai-Ramsey number} is defined to be the minimum number of vertices such that any -edge coloring of contains…
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…
Proper connection number and graph products
Yaping Mao, Fengnan Yanling, Zhao Wang +1
A path in an edge-colored graph is called \emph{a proper path} if no two adjacent edges of are colored the same, and is \emph{proper connected} if every two vertice…
Monochromatic connectivity and graph products
Yaping Mao, Zhao Wang, Fengnan Yanling +1
The concept of monochromatic connectivity was introduced by Caro and Yuster. A path in an edge-colored graph is called a \emph{monochromatic path} if all the edges on the path are…