Add to ORKGThe 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
Let G be a connected graph. A vertex w ∈ V.G/ strongly resolves two vertices u,v ∈ V.G/ if there exi...
The basis number b(G) of a graph G is defined to be the least integer k such that G has a k-fold bas...
For a connected graph G with at least two vertices and S a subset of vertices, the convex hull $[S]_...
The basis number of a graph G is defined to be the least integer d such that there is a basis B of t...
The basis number of a graph G is defined to be the least integer d such that there is a basis B of t...
The basis number b(G) ofagraphGis defined to be the least integer d such that G has a d-fold basis f...
The basis number of a graph G is defined to be the least non negative integer d such that there is a...
In graph theory, there are many numbers that give rise to a better understanding and interpretation ...
summary:The basis number of a graph $G$ is defined by Schmeichel to be the least integer $h$ such th...
A construction of a minimum cycle bases for the wreath product of some classes of graphs is presente...
The basis number of a graph G is defined to be the least integer d such that G has a d-fold basis fo...
A construction of a minimum cycle bases for the wreath product of some classes of graphs is presente...
The basis number b(G) of a graphG is defined to be the least integer k such thatG has a k-fold basis...
AbstractThe independence number of the strong product of cycles is considered in this paper. We desc...
AbstractA basis of the cycle space C(G) of a graph G is h-fold if each edge of G occurs in at most h...
Let G be a connected graph. A vertex w ∈ V.G/ strongly resolves two vertices u,v ∈ V.G/ if there exi...
The basis number b(G) of a graph G is defined to be the least integer k such that G has a k-fold bas...
For a connected graph G with at least two vertices and S a subset of vertices, the convex hull $[S]_...
The basis number of a graph G is defined to be the least integer d such that there is a basis B of t...
The basis number of a graph G is defined to be the least integer d such that there is a basis B of t...
The basis number b(G) ofagraphGis defined to be the least integer d such that G has a d-fold basis f...
The basis number of a graph G is defined to be the least non negative integer d such that there is a...
In graph theory, there are many numbers that give rise to a better understanding and interpretation ...
summary:The basis number of a graph $G$ is defined by Schmeichel to be the least integer $h$ such th...
A construction of a minimum cycle bases for the wreath product of some classes of graphs is presente...
The basis number of a graph G is defined to be the least integer d such that G has a d-fold basis fo...
A construction of a minimum cycle bases for the wreath product of some classes of graphs is presente...
The basis number b(G) of a graphG is defined to be the least integer k such thatG has a k-fold basis...
AbstractThe independence number of the strong product of cycles is considered in this paper. We desc...
AbstractA basis of the cycle space C(G) of a graph G is h-fold if each edge of G occurs in at most h...
Let G be a connected graph. A vertex w ∈ V.G/ strongly resolves two vertices u,v ∈ V.G/ if there exi...
The basis number b(G) of a graph G is defined to be the least integer k such that G has a k-fold bas...
For a connected graph G with at least two vertices and S a subset of vertices, the convex hull $[S]_...