Maxima of the -index: Graphs with no -minor
arXiv:2202.09569
Abstract
A graph is said to be \textit{-minor free} if it does not contain as a minor. In this paper, we characteristic the unique extremal graph with maximal -index among all -vertex -minor free graphs ().
15 pages