Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
140 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Spectral conditions of pancyclicity for t-tough graphs (2406.17089v1)

Published 24 Jun 2024 in math.CO and cs.DM

Abstract: More than 40 years ago Chv\'atal introduced a new graph invariant, which he called graph toughness. From then on a lot of research has been conducted, mainly related to the relationship between toughness conditions and the existence of cyclic structures, in particular, determining whether the graph is Hamiltonian and pancyclic. A pancyclic graph is certainly Hamiltonian, but not conversely. Bondy in 1976, however, suggested the "metaconjecture" that almost any nontrivial condition on a graph which implies that the graph is Hamiltonian also implies that the graph is pancyclic. We confirm the Bondy conjecture for t-tough graphs in the case when $t\in { 1;2;3}$ in terms of the edge number, the spectral radius and the signless Laplacian spectral radius of the graph.

Summary

We haven't generated a summary for this paper yet.