Author/Authors :
دريكوند، تاجدالدين نويسنده Department of Mathematics, Marvdasht Branch, Islamic Azad University, Marvdasht, Iran Derikvand, Tajedin , ابودي، محمد رضا نويسنده Department of Mathematics, University of Isfahan, Isfahan 81746{73441, Iran Oboudi, Mohammad Reza
Abstract :
Let G be a simple graph. An independent set is a set of pairwise non-adjacent vertices.
The number of vertices in a maximum independent set of G is denoted by (G). In this paper,
we characterize graphs G with n vertices and with maximum number of maximum independent sets
provided that (G) 2 or (G) n ?? 3.
