Lexicographic product and isoperimetric number (Q2449264)

Summary: The isoperimetric number of a graph \(G\), denoted by \(i(G)\), was introduced by \textit{B. Mohar} [J. Comb. Theory, Ser. B 47, No. 3, 274--291 (1989; Zbl 0719.05042)]. A graph \(G\) and a subset \(X\) of its vertices are given, and let \(\partial(X)\) denote the edge boundary of \(X\), the set of edges which connects vertices in \(X\) to vertices not in \(X\). The isoperimetric number of \(G\) is defined as \(i(G)=\min_{1\leq|X|\leq|V(G)|/2}(|\partial(X)|/|X|)\). In this paper, some results about the isoperimetric number of graphs obtained by graph operations are given.