3 papers
math.CO2025
The minimum size of a -connected locally nonforesty graph
Chengli Li, Yurui Tang, Xingzhi Zhan
A local subgraph of a graph is the subgraph induced by the neighborhood of a vertex. Thus a graph of order has local subgraphs. A graph is called locally nonforesty if…
math.CO2024
Sparse graphs with an independent or foresty minimum vertex cut
Kun Cheng, Yurui Tang, Xingzhi Zhan
A connected graph is called fragile if it contains an independent vertex cut. In 2002 Chen and Yu proved that every connected graph of order and size at most is fragile,…
math.CO2024
The maximum number of cliques in graphs with given fractional matching number and minimum degree
Chengli Li, Yurui Tang
Recently, Ma, Qian and Shi determined the maximum size of an -vertex graph with given fractional matching number and maximum degree at most . Motivated by this result, we…