We consider the connected graphs with a unique vertex of maximum degree \(3\). Two subfamilies of such graphs are characterized and ordered completely by their indices. Moreover, a conjecture about the complete ordering of all graphs in this set is proposed.
Citation
Kexiang Xu, Baogang Xu. Ordering Graphs with Maximum Degree \(3\) by Their Indices[J], Ars Combinatoria, Volume 091. 193-201. .