Add to ORKGMinimum cycle bases of product graphs can in most situations be constructed from minimum cycle bases of the factors together with a suitable collection of triangles and/or quadrangles determined by the product operation. Here we give an explicit construction for the lexicographic product G H that generalizes results by Berger and Jaradat to the case that H is not connected
The basis number b(G) ofagraphGis defined to be the least integer d such that G has a d-fold basis f...
There are four prominent product graphs in graph theory: Cartesian, strong, direct, and lexicographi...
We study the polytopality of Cartesian products of non-polytopal graphs. On the one hand, we prove ...
A construction of minimum cycle bases of the lexicographic product of graphs is presented. Moreover,...
A construction of a minimum cycle bases for the wreath product of some classes of graphs is presente...
A construction of a minimum cycle bases for the wreath product of some classes of graphs is presente...
The length of a cycle basis of a graph is the sum of the lengths of its elements. A minimum cycle ba...
The perception of cyclic structures is a crucial step in the analysis of graphs. To describe the cyc...
In this article, we give the minimum number of moves required for the motion planning problem in Lex...
Cycles in graphs play an important role in many applications, e.g., analysis of electrical networks,...
Abstract. In this paper, lexicographic products of two fuzzy graphs namely, lexicographic min-produc...
Graph TheoryThe generalized k-connectivity κk(G) of a graph G, first introduced by Hager, is a natur...
For the lexicographic product $G\bullet H$ of two graphs $G$ and $H$ so that $G$ is connected, we pr...
AbstractLet G[H] be the lexicographic product of graphs G and H and let G ⊕ H be their Cartesian sum...
The length of a cycle basis of a graph is the sum of the lengths of its elements. A minimum cycle ba...
The basis number b(G) ofagraphGis defined to be the least integer d such that G has a d-fold basis f...
There are four prominent product graphs in graph theory: Cartesian, strong, direct, and lexicographi...
We study the polytopality of Cartesian products of non-polytopal graphs. On the one hand, we prove ...
A construction of minimum cycle bases of the lexicographic product of graphs is presented. Moreover,...
A construction of a minimum cycle bases for the wreath product of some classes of graphs is presente...
A construction of a minimum cycle bases for the wreath product of some classes of graphs is presente...
The length of a cycle basis of a graph is the sum of the lengths of its elements. A minimum cycle ba...
The perception of cyclic structures is a crucial step in the analysis of graphs. To describe the cyc...
In this article, we give the minimum number of moves required for the motion planning problem in Lex...
Cycles in graphs play an important role in many applications, e.g., analysis of electrical networks,...
Abstract. In this paper, lexicographic products of two fuzzy graphs namely, lexicographic min-produc...
Graph TheoryThe generalized k-connectivity κk(G) of a graph G, first introduced by Hager, is a natur...
For the lexicographic product $G\bullet H$ of two graphs $G$ and $H$ so that $G$ is connected, we pr...
AbstractLet G[H] be the lexicographic product of graphs G and H and let G ⊕ H be their Cartesian sum...
The length of a cycle basis of a graph is the sum of the lengths of its elements. A minimum cycle ba...
The basis number b(G) ofagraphGis defined to be the least integer d such that G has a d-fold basis f...
There are four prominent product graphs in graph theory: Cartesian, strong, direct, and lexicographi...
We study the polytopality of Cartesian products of non-polytopal graphs. On the one hand, we prove ...