Large Isaacs' graphs are maximally non-Hamilton-connected (Q750459): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
(One intermediate revision by one other user not shown) | |||
Property / cites work | |||
Property / cites work: Q5422499 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Smallest maximally nonhamiltonian graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: New families of hypohamiltonian graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4143338 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3926602 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3487383 / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0012-365x(90)90049-n / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2016058531 / rank | |||
Normal rank |
Latest revision as of 12:00, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Large Isaacs' graphs are maximally non-Hamilton-connected |
scientific article |
Statements
Large Isaacs' graphs are maximally non-Hamilton-connected (English)
0 references
1990
0 references
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\).
0 references
Isaacs' graph
0 references
maximally non-Hamiltonian-connected
0 references