Let (OEIS A060006) be the plastic constant and define
(1)
| |||
(2)
|
(OEIS A372244). Then a maverick graph is a connected graph with smallest graph eigenvalue satisfying that is not an augmented path extension of any rooted graph (Acharya and Jiang 2024).
There are a total of 4752 of maverick graphs, and the numbers of such graphs on , ..., 19 vertices are 13, 629, 1304, 1237, 775, 408, 221, 107, 42, 13, 3 (OEIS A372243; Acharya and Jiang 2024). The 13 maverick graphs on 9 vertices are illustrated above. The 629 maverick graphs on 10 nodes include the (5,5)-tadpole graph, 9-pan graph, and (3,5,3)-kayak paddle graph.