3 papers
math.RA2023
A new class of partial orders
Huihui Zhu, Liyun Wu
Let be a unital -ring. For any , we apply the defined -core inverse to define a new class of partial orders in , called the -core partial order. Suppose…
math.CO2020
Connectivity keeping paths in -connected bipartite graphs
Lian Luo, Yingzhi Tian, Liyun Wu
In 2010, Mader [W. Mader, Connectivity keeping paths in -connected graphs, J. Graph Theory 65 (2010) 61-69.] proved that every -connected graph with minimum degree at lea…
math.CO2019
The connectivity of a bipartite graph and its bipartite complementary graph
Huaping Ma, Yingzhi Tian, Liyun Wu
In 1956, Nordhaus and Gaddum gave lower and upper bounds on the sum and the product of the chromatic number of a graph and its complement, in terms of the order of the graph. Since…