Wyniki wyszukiwania

Sortuj według:

Ogranicz wyniki do:

Artykuł dostępny w postaci pełnego tekstu - kliknij by otworzyć plik

On the basis number and the minimum cycle bases of the wreath product of some graphs i

100%

Jaradat M.

Discussiones Mathematicae Graph Theory

2006

tom 26

nr 1

113-134

A construction of a minimum cycle bases for the wreath product of some classes of graphs is presented. Moreover, the basis numbers for the wreath product of the same classes are determined.

An upper bound of the basis number of the strong product of graphs

100%

Jaradat M.

Discussiones Mathematicae Graph Theory

2005

tom 25

nr 3

391-406

The basis number of a graph G is defined to be the least integer d such that there is a basis B of the cycle space of G such that each edge of G is contained in at most d members of B. In this paper we give an upper bound of the basis number of the strong product of a graph with a bipartite graph and we show that this upper bound is the best possible.

Ograniczanie wyników

2 Discussiones Mathematicae Graph Theory

2 Jaradat M.

1 2006

1 2005

Wyniki wyszukiwania

On the basis number and the minimum cycle bases of the wreath product of some graphs i

An upper bound of the basis number of the strong product of graphs