On average lower independence and domination numbers in graphs Original Research Article

The average lower independence number image of a graph image is defined as image, and the average lower domination number image is defined as image, where image (resp. image is the minimum cardinality of a maximal independent set (resp. dominating set) that contains image. We give an upper bound of image and image for arbitrary graphs. Then we characterize the graphs achieving this upper bound for image and for image respectively.