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 条

[31] A lower bound on cochromatic number for line graphs of a kind of graphs
Xinsheng L.
Xiang’en C.
Lifeng O.
[J]. Applied Mathematics-A Journal of Chinese Universities, 2006, 21 (3) : 357 - 360
[32] A LOWER BOUND ON COCHROMATIC NUMBER FOR LINE GRAPHS OF A KIND OF GRAPHS
Liu Xinsheng~1 Chen Xiang’en~1 Ou Lifeng~2 1 College of Mathematics and Information Science
[J]. Applied Mathematics:A Journal of Chinese Universities, 2006, (03) : 357 - 360
[33] Improved lower bound on the energy of line graphs
Akbari, Saieed
Lin, Hongying
[J]. LINEAR ALGEBRA AND ITS APPLICATIONS, 2023, 674 : 442 - 452
[34] Improving a Lower Bound for Seidel Energy of Graphs
Oboudi, Mohammad Reza
Nematollahi, Mohammad Ali
[J]. MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY, 2023, 89 (02) : 489 - 502
[35] A lower bound on the chromatic number of Mycielski graphs
Caramia, M
Dell'Olmo, P
[J]. DISCRETE MATHEMATICS, 2001, 235 (1-3) : 79 - 86
[36] Lower bound number of irreducible graphs on surfaces
Liu, Y
Liu, YP
[J]. ACTA MATHEMATICA SCIENTIA, 1998, 18 (03) : 333 - 339
[37] A lower bound for the energy of symmetric matrices and graphs
Andrade, Enide
Robbiano, Maria
San Martin, B.
[J]. LINEAR ALGEBRA AND ITS APPLICATIONS, 2017, 513 : 264 - 275
[38] A LOWER BOUND ON CONNECTIVITIES OF MATROID BASE GRAPHS
LIU, GZ
[J]. DISCRETE MATHEMATICS, 1988, 69 (01) : 55 - 60
[39] On a Lower Bound for the Eccentric Connectivity Index of Graphs
Bantva, Devsi
[J]. ALGORITHMS AND DISCRETE APPLIED MATHEMATICS, CALDAM 2018, 2018, 10743 : 179 - 187
[40] A new lower bound on the independence number of graphs
Angel, Eric
Campigotto, Romain
Laforest, Christian
[J]. DISCRETE APPLIED MATHEMATICS, 2013, 161 (06) : 847 - 852

← 1 2 3 4 5 →