Large Isaacs' graphs are maximally non-Hamilton-connected (Q750459): Difference between revisions

For integer \(k\geq 2\), the Isaacs' graph \(J_{2k+1}\) is the disjoint union of \(2k+1\) copies of \(S_ i\) \((\cong K_{1,3}\), where \(S_ i\) has vertices \(a_ i\), \(c_ i\), \(d_ i\) with degree one and \(b_ i\) has degree 3), together with all edges \(a_ ia_{i+1}\), \(c_ id_{i+1}\), \(d_ ic_{i+1}\) for \(0\leq i\leq 2k\) (the subscripts are modulo \(2k+1).\) Theorem: The Isaacs' graphs \(J_{2k+1}\) are maximally non-Hamiltonian- connected for all integers \(k\geq 3\).