The spectral radii and extremal graphs of two types of minimal graphs

Liwen Lian, Jinfeng Liu, Mengyuan Niu +1

A connected nontrivial graph $G$ is {\it matching covered} if every edge of $G$ is contained in some perfect matching of $G$. A matching covered graph $G$ is {\it minimal} if $G-e$…