3 papers
math.CO2025
The spectral radii and extremal graphs of two types of minimal graphs
Liwen Lian, Jinfeng Liu, Mengyuan Niu +1
A connected nontrivial graph is {\it matching covered} if every edge of is contained in some perfect matching of . A matching covered graph is {\it minimal} if …
math.CO2025
Claw-free bricks that every -invariant edge is solitary
Yipei Zhang, Xiumei Wang
A graph is a brick if it is 3-connected and has a perfect matching for any two distinct vertices and of . Lucchesi and Murty proposed a problem concernin…
math.CO2025
Solid bricks that every -invariant edge is solitary
Yipei Zhang, Xiumei Wang
A graph is a brick if it is 3-connected and has a perfect matching for any two distinct vertices and of . A brick is solid if for any two vertex disj…