If G is a tricyclic Hamiltonian graph of order n with maximum degree 3 then G has one of two forms, X(q, r, s, t) and Y(q, T, S, t), where q + r + s + j = n. We find the graph G with maximal index by first identifying the graphs of each form having maximal index.
展开▼
机译：如果G是阶数为n且最大阶数为3的三环哈密顿图，则G具有以下两种形式之一：X（q，r，s，t）和Y（q，T，S，t），其中q + r + s + j = n。通过首先识别具有最大索引的每种形式的图，我们找到具有最大索引的图G。
展开▼
