A new upper bound on the Cheeger number of a graph

被引：0

作者：

Dragomir, S ^{[1
]}

Barletta, E ^{[1
]}

机构：

[1] Univ Basilicata, Dipartimento Matemat, I-85100 Potenza, Italy

来源：

JOURNAL OF COMBINATORIAL THEORY SERIES B | 2001年 / 82卷 / 02期

关键词：

D O I：

10.1006/jctb.2000.2023

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

Using a technique developed by A. Nilli (1991, Discrete Math. 91. 207-210). we estimate from above the Cheeger number of a finite connected graph G of small degree (Delta (G) less than or equal to 5) admitting sufficiently distant edges. (C) 2001 Academic Press.

引用

页码：167 / 174

页数：8

共 50 条

[1] A NEW UPPER BOUND FOR THE DOMINATION NUMBER OF A GRAPH
MARCU, D
QUARTERLY JOURNAL OF MATHEMATICS, 1985, 36 (142): : 221 - 223
[2] AN UPPER BOUND ON THE CHEEGER CONSTANT OF A DISTANCE-REGULAR GRAPH
Kim, Gil Chun
Lee, Yoonjin
BULLETIN OF THE KOREAN MATHEMATICAL SOCIETY, 2017, 54 (02) : 507 - 519
[3] A new upper bound on the number of edges in a geodetic graph
Mao, JZ
Li, DY
DISCRETE MATHEMATICS, 1999, 202 (1-3) : 183 - 189
[4] A new upper bound on the total domination number of a graph
Henning, Michael A.
Yeo, Anders
ELECTRONIC JOURNAL OF COMBINATORICS, 2007, 14 (01):
[5] A New Upper Bound on the Number of Spanning Trees of a Graph
Li, Rao
UTILITAS MATHEMATICA, 2013, 91 : 339 - 343
[6] AN UPPER BOUND FOR THE PATH NUMBER OF A GRAPH
DONALD, A
JOURNAL OF GRAPH THEORY, 1980, 4 (02) : 189 - 201
[7] AN UPPER BOUND ON THE NUMBER OF CLIQUES IN A GRAPH
FARBER, M
HUJTER, M
TUZA, Z
NETWORKS, 1993, 23 (03) : 207 - 210
[8] AN UPPER BOUND ON THE DOMINATION NUMBER OF A GRAPH
MARCU, D
MATHEMATICA SCANDINAVICA, 1986, 59 (01) : 41 - 44
[9] AN UPPER BOUND OF A GENERALIZED UPPER HAMILTONIAN NUMBER OF A GRAPH
Dzurik, Martin
ARCHIVUM MATHEMATICUM, 2021, 57 (05): : 299 - 311
[10] New upper bound for the chromatic number of a random subgraph of a distance graph
A. S. Gusev
Mathematical Notes, 2015, 97 : 326 - 332

← 1 2 3 4 5 →