Wyniki wyszukiwania

Sortuj według:

Ogranicz wyniki do:

The Crossing Numbers of Products of Path with Graphs of Order Six

100%

Klešč M., Petrillová J.

Discussiones Mathematicae Graph Theory

2013

tom 33

nr 3

571-582

The crossing numbers of Cartesian products of paths, cycles or stars with all graphs of order at most four are known. For the path Pn of length n, the crossing numbers of Cartesian products G⃞Pn for all connected graphs G on five vertices are also known. In this paper, the crossing numbers of Cartesian products G⃞Pn for graphs G of order six are studied. Let H denote the unique tree of order six with two vertices of degree three. The main contribution is that the crossing number of the Cartesian product H⃞Pn is 2(n − 1). In addition, the crossing numbers of G⃞Pn for fourty graphs G on six vertices are collected

On the Crossing Numbers of Cartesian Products of Wheels and Trees

81%

Klešč M., Petrillová J., Valo M.

Discussiones Mathematicae Graph Theory

2017

tom 37

nr 2

399-413

Bokal developed an innovative method for finding the crossing numbers of Cartesian product of two arbitrarily large graphs. In this article, the crossing number of the join product of stars and cycles are given. Afterwards, using Bokal’s zip product operation, the crossing numbers of the Cartesian products of the wheel Wn and all trees T with maximum degree at most five are established.

Ograniczanie wyników

2 Discussiones Mathematicae Graph Theory

2 Klešč M.

2 Petrillová J.

1 Valo M.

1 2017

1 2013

Wyniki wyszukiwania

The Crossing Numbers of Products of Path with Graphs of Order Six

On the Crossing Numbers of Cartesian Products of Wheels and Trees