تصفح حسب الموضوع "Cycle space"
السجلات المعروضة 1 -- 7 من 7
-
A new upper bound of the basis number of the lexicographic product of graphs
( Charles Babbage Research Centre , 2010 , Article)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. -
Fundamental group and cycle space of dual graphs and applications
( Elsevier , 2010 , Article)In this work, we study the fundamental group of dual graph of a planar graph. Moreover, we show that a planar graph G has no cut vertex if and only if N(Π(D(G))) = N(Π(D(G − v))) − 1 for any v ∈ V(G). Some applications ... -
On minimum cycle bases of the wreath product of wheels with stars
( Zenodo , 2010 , Article)The length of a cycle basis of a graph is the sum of the lengths of its elements. A minimum cycle basis is a cycle basis with minimum length. In this work, a construction of a minimum cycle basis for the wreath product of ... -
On the basis number and the minimum cycle bases of the wreath product of some graphs II
( University of Zielona Gora , 2010 , Article)A construction of a minimum cycle bases for the wreath product of a star by a path, two stars and a star by a wheel is given. Moreover, the basis numbers of these products are determined. -
On the basis number of the wreath product of ladders
( Charles Babbage Research Centre , 2016 , Article)The basis number of a graph G is defined to be the least non negative 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 determine ... -
On the basis number of the wreath product of paths with wheels and some related problems
( Charles Babbage Research Centre , 2017 , Article)In this paper, we investigate the basis number for the wreath product of wheels with paths. Also, as a related problem, we construct a minimum cycle basis of the same. -
An upper bound of the basis number of the semi-strong product of cycles with bipartite graphs
( The Korean Mathematical Society , 2007 , Article)An upper bound of the basis number of the semi-strong product of cycles with bipartite graphs is given. Also, an example is presented where the bound is achieved.