Lower bound for the size of maximal nontraceable graphs

被引：0
|
作者：
Frick, M [1 ]
Singleton, J [1 ]
机构：
[1] Univ S Africa, ZA-0003 Unisa, South Africa
来源：
ELECTRONIC JOURNAL OF COMBINATORICS | 2005年 / 12卷 / 01期
关键词：
maximal nontraceable; hamiltonian path; traceable; nontraceable; nonhamiltonian;
D O I：
暂无
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
Let 9(n) denote the minimum number of edges of a maximal nontraceable graph of order n. Dudek, Katona and Wojda (2003) showed that g(n) >= [3n-2/2]-2 for n >= 20 and g(n) <= [3n-2/2] for n >= 54 as well as for n is an element of I = {22, 23, 30, 31, 38, 39, 40, 41, 42, 43, 46, 47, 48, 49, 50, 51}. We show that g(n) = [3n-2/2] for n >= 54 as well as for n is an element of I boolean OR {12, 13} and we determine g(n) for n <= 9.
引用
收藏
页数：9
相关论文
共 50 条
  • [1] Further results on Maximal Nontraceable graphs of smallest size
    Burger, Alewyn P.
    Singleton, Joy E.
    [J]. DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 2013, 15 (01): : 75 - 92
  • [2] Cubic maximal nontraceable graphs
    Frick, Marietjie
    Singleton, Joy
    [J]. DISCRETE MATHEMATICS, 2007, 307 (7-8) : 885 - 891
  • [3] Smallest claw-free, 2-connected, nontraceable graphs and the construction of maximal nontraceable graphs
    Bullock, Frank
    Frick, Marietjie
    Singleton, Joy
    [J]. DISCRETE MATHEMATICS, 2007, 307 (11-12) : 1266 - 1275
  • [4] Connectivity of Claw-free Maximal Nontraceable Graphs
    Dunbar, Jean E.
    Frick, Marietjie
    Harris, John M.
    van Aardt, Susan
    [J]. UTILITAS MATHEMATICA, 2011, 84 : 245 - 255
  • [5] Maximal nontraceable graphs with toughness less than one
    Bullock, Frank
    Frick, Marietjie
    Singleton, Joy
    van Aardt, Susan
    Mynhardt, Kieka C. M.
    [J]. ELECTRONIC JOURNAL OF COMBINATORICS, 2008, 15 (01):
  • [6] The sharpness of a lower bound on the algebraic connectivity for maximal graphs
    Kirkland, SJ
    Molitierno, JJ
    Neumann, M
    [J]. LINEAR & MULTILINEAR ALGEBRA, 2001, 48 (03): : 237 - 246
  • [7] A TIGHT LOWER BOUND ON THE SIZE OF VISIBILITY GRAPHS
    SHEN, X
    EDELSBRUNNER, H
    [J]. INFORMATION PROCESSING LETTERS, 1987, 26 (02) : 61 - 64
  • [8] Nontraceable detour graphs
    Bullock, Frank
    Frick, Marietjie
    Semanisin, Gabriel
    Vlacuha, Robert
    [J]. DISCRETE MATHEMATICS, 2007, 307 (7-8) : 839 - 853
  • [9] General lower bound on the size of (H; k)-stable graphs
    Zak, Andrzej
    [J]. JOURNAL OF COMBINATORIAL OPTIMIZATION, 2015, 29 (02) : 367 - 372
  • [10] A lower bound on the size of (H; 1)-vertex stable graphs
    Cichacz, Sylwia
    Goerlich, Agnieszka
    Nikodem, Mateusz
    Zak, Andrzej
    [J]. DISCRETE MATHEMATICS, 2012, 312 (20) : 3026 - 3029
12345