Monochromatic connectivity and graph products. - Yaping Mao; Zhao Wang 007; Fengnan Yanling; Chengfu Ye (Discret. Math. Algorithms Appl., 2016)

Rainbow vertex-connection and graph products. - Yaping Mao; Fengnan Yanling; Zhao Wang 007; Chengfu Ye (Int. J. Comput. Math., 2016)

Steiner Distance in Join, Corona and Threshold Graphs. - Zhao Wang 007; Yaping Mao; Christopher Melekian; Eddie Cheng 001 (ISPAN-FCST-ISCC, 2017)

Nordhaus-Gaddum-type results for the Steiner Wiener index of graphs. - Yaping Mao; Zhao Wang 007; Ivan Gutman; He Li (Discret. Appl. Math., 2017)

Super Edge-Connectivity of Strong Product Graphs. - Zhao Wang 007; Yaping Mao; Chengfu Ye; Haixing Zhao (J. Interconnect. Networks, 2017)

The k-independence number of graph products. - Yaping Mao; Eddie Cheng 001; Zhao Wang 007; Zhiwei Guo (Art Discret. Appl. Math., 2018)

Steiner Distance in Product Networks. - Yaping Mao; Eddie Cheng 001; Zhao Wang 007 (Discret. Math. Theor. Comput. Sci., 2018)

On the Steiner 4-Diameter of Graphs. - Zhao Wang 007; Yaping Mao; Hengzhe Li; Chengfu Ye (J. Interconnect. Networks, 2018)

Strong matching preclusion number of graphs. - Yaping Mao; Zhao Wang 007; Eddie Cheng 001; Christopher Melekian (Theor. Comput. Sci., 2018)

Gallai-Ramsey numbers for books. - Jinyu Zou; Yaping Mao; Colton Magnant; Zhao Wang 007; Chengfu Ye (Discret. Appl. Math., 2019)

Steiner Distance in Join, Corona, Cluster, and Threshold Graphs. - Zhao Wang 007; Yaping Mao; Christopher Melekian; Eddie Cheng 001 (J. Inf. Sci. Eng., 2019)

Matching preclusion number in product graphs. - Zhao Wang 007; Christopher Melekian; Eddie Cheng 001; Yaping Mao (Theor. Comput. Sci., 2019)

Matching preclusion number of graphs. - Zhao Wang 007; Yaping Mao; Eddie Cheng 001; Jinyu Zou (Theor. Comput. Sci., 2019)

Ramsey and Gallai-Ramsey numbers for stars with extra independent edges. - Yaping Mao; Zhao Wang 007; Colton Magnant; Ingo Schiermeyer (Discret. Appl. Math., 2020)

Nordhaus-Gaddum-Type Results for the Steiner Gutman Index of Graphs. - Zhao Wang 007; Yaping Mao; Kinkar Chandra Das; Yilun Shang (Symmetry, 2020)

On the g-good-neighbor connectivity of graphs. - Zhao Wang 007; Yaping Mao; Sun-Yuan Hsieh; Jichang Wu (Theor. Comput. Sci., 2020)

Steiner diameter, maximum degree and size of a graph. - Yaping Mao; Peter Dankelmann; Zhao Wang 007 (Discret. Math., 2021)

Ramsey and Gallai-Ramsey Numbers for Two Classes of Unicyclic Graphs. - Zhao Wang 007; Yaping Mao; Colton Magnant; Jinyu Zou (Graphs Comb., 2021)

Linear k-arboricity of Caylay Graphs on Abelian Groups with Given Degree. - Nan Jia; Yaping Mao; Zhao Wang 007; Eddie Cheng 001 (Math. Comput. Sci., 2021)

Fractional matching preclusion number of graphs. - Jinyu Zou; Yaping Mao; Zhao Wang 007; Eddie Cheng 001 (Discret. Appl. Math., 2022)

Ramsey and Gallai-Ramsey Number for Wheels. - Yaping Mao; Zhao Wang 007; Colton Magnant; Ingo Schiermeyer (Graphs Comb., 2022)

On relations between Sombor and other degree-based indices. - Zhao Wang 007; Yaping Mao; Yue Li; Boris Furtula (J. Appl. Math. Comput., 2022)

Arithmetic progressions, quasi progressions, and Gallai-Ramsey colorings. - Yaping Mao; Kenta Ozeki; Aaron Robertson; Zhao Wang 007 (J. Comb. Theory A, 2023)

Gallai-Ramsey numbers for fans. - Yaping Mao; Zhao Wang 007; Colton Magnant; Ingo Schiermeyer (Discret. Math., 2023)

Gallai-Ramsey Numbers Involving a Rainbow 4-Path. - Jinyu Zou; Zhao Wang 007; Hong-Jian Lai; Yaping Mao (Graphs Comb., 2023)

The g-extra connectivity of graph products. - Zhao Wang 007; Yaping Mao; Sun-Yuan Hsieh; Ralf Klasing; Yuzhi Xiao (J. Comput. Syst. Sci., 2024)

The g-good-neighbor diagnosability of product networks under the PMC model. - Zhao Wang 007; Yaping Mao; Sun-Yuan Hsieh; Ralf Klasing (CoRR, 2025)