A new upper bound of the basis number of the lexicographic product of graphs

Abstract

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.