On the binding number of lexicographic product of wheels with some graphs

Abstract EN

The binding number of a graph G, b (G) is defined as : b (G) = min{ | N (S)| / | S | }, where the minimum is taken over all non-empty subsets S of the vertex set V of G and neighborhood of S, i.

e., N(S) such that N (S) ≠ V.

In this paper, we determine the binding number of the lexicographic product of wheels with: ladder graphs, complete graphs, complete bipartite graphs and their complements.