A new upper bound of the basis number of the lexicographic product of graphs

被引：0

作者：

Jaradat, M. M. M. ^{[1
,2
]}

机构：

[1] Yarmouk Univ, Dept Math, Irbid, Jordan

[2] Qatar Univ, Dept Math & Phys, Doha, Qatar

来源：

ARS COMBINATORIA | 2010年 / 97卷

关键词：

Cycle space; Cycle basis; Basis number; Lexicographic product;

D O I：

暂无

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

An upper bound of the basis number of the lexicographic product of two graphs from the basis number of the factors is presented. Furthermore, the basis numbers of the lexicographic product of some classes of graphs is determined.

引用

页码：423 / 442

页数：20

共 18 条

[1]

AIL AA, 1993, ARS COMBINATORIA, V33, P271

[2]

Ali A. A., 1992, J INDIAN MATH SOC, V58, P123

[3]

ALI AA, 1989, ARS COMBINATORIA, V28, P41

[4] The basis number of the composition of theta graphs with stars and wheels [J].

Alzoubi, MY ;

Jaradat, MMM .

ACTA MATHEMATICA HUNGARICA, 2004, 103 (03) :255-263

[5]

Bondy J. A., 1976, Graduate Texts in Mathematics, V290

[6]

CHEN WK, 1971, SIAM J APPL MATH, V20, P525

[7]

Chua L. O., 1973, IEEE T CIRCUIT THEOR, V20, P54

[8] REVIEW OF RING PERCEPTION ALGORITHMS FOR CHEMICAL GRAPHS [J].

DOWNS, GM ;

GILLET, VJ ;

HOLLIDAY, JD ;

LYNCH, MF .

JOURNAL OF CHEMICAL INFORMATION AND COMPUTER SCIENCES, 1989, 29 (03) :172-187

[9]

Imrich W, 2000, WIL INT S D

[10]

Jaradat M. M. M., 2005, Discussiones Mathematicae Graph Theory, V25, P391, DOI 10.7151/dmgt.1291

← 1 2 →