Further results on maximal nontraceable graphs of smallest size - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Article Dans Une Revue Discrete Mathematics and Theoretical Computer Science Année : 2013

Further results on maximal nontraceable graphs of smallest size

Résumé

Let g(n) denote the minimum number of edges of a maximal nontraceable (MNT) graph of order n. In 2005 Frick and Singleton (Lower bound for the size of maximal nontraceable graphs, Electronic Journal of Combinatorics, 12(1) R32, 2005) proved that g(n) = ⌈3n-22 ⌉ for n ≥54 as well as for n ∈I, where I= 12,13,22,23,30,31,38,39, 40,41,42,43,46,47,48,49,50,51 and they determined g(n) for n ≤9. We determine g(n) for 18 of the remaining 26 values of n, showing that g(n) = ⌈ 3n-22 ⌉ for n ≥54 as well as for n ∈I ∪18,19,20,21,24,25,26,27,28, 29,32,33 and g(n) = ⌈ 3n2 ⌉ for n ∈ 10, 11, 14, 15, 16, 17. We give results based on ''analytic'' proofs as well as computer searches.
Fichier principal
Vignette du fichier
2136-7732-1-PB.pdf (385.25 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00990607 , version 1 (13-05-2014)

Identifiants

Citer

Alewyn Petrus Burger, Joy Elizabeth Singleton. Further results on maximal nontraceable graphs of smallest size. Discrete Mathematics and Theoretical Computer Science, 2013, Vol. 15 no. 1 (1), pp.75--92. ⟨10.46298/dmtcs.627⟩. ⟨hal-00990607⟩

Collections

TDS-MACS
57 Consultations
797 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More