Davood Fatehi, Saeid Alikhani, Abdul Jalil M. Khalaf
الملخص العربي
Let be a simple graph. A set is an independent set, if no two of its members are adjacent in G. The k-independent graph of G, is defined to be the graph whose vertices correspond to the independent sets of G that have cardinality at most k. Two vertices in are adjacent if and only if the corresponding independent sets of G differ by either adding or deleting a single vertex. In this paper, we obtain some properties of and compute it for some graphs
عبد الجليل منشد خلف | Abdul Jalil M. Khalaf | 3165