On the Toughness of Regular Graphs and Prisms
Geoffrey Boyer, Wayne Goddard

TL;DR
This paper investigates the toughness of regular graphs and their prisms, providing new bounds, existence results, and specific constructions, including the first family of 4-regular graphs with toughness 2 containing claws.
Contribution
It presents new existence results for regular graphs with specific toughness, introduces the first family of 4-regular graphs with toughness 2 containing claws, and establishes bounds on the toughness of graph prisms.
Findings
No 5-regular graph with toughness 5/2 exists for n=18.
Constructed the first 4-regular graphs with toughness 2 containing claws.
Prism of a graph with toughness t ≤ 1/2 has toughness 2t.
Abstract
We contribute results on -regular graphs that do and don't have the maximum possible toughness, namely . Doty and Ferland showed the existence of a -regular graph with toughness for all even orders except . Using a computer search we show that there does not exist such a graph for . Also, we provide the first family of -regular graphs with toughness that contains claws. For the prism of a graph~, we provide several bounds including a sufficient condition for the prism to have the same toughness as~. In particular, we show that if has toughness then its prism has toughness ; further, the prism of any -regular -connected inflation has toughness~ (despite being -regular) and in general the prism of any -regular graph has toughness at most~.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicsgraph theory and CDMA systems · Coding theory and cryptography · Finite Group Theory Research
