Average lower independence number in splitting graphs
Articles > Article · 2016
Authors: Aysun AYTAÇ, Betul Atay
New Trends in Mathematical Science, International, 2016, vol 4, pp 259-259
Summary
Let G be a graph.The splitting graph S ′ (G) for a graph G is obtained by adding a new vertex v ′ corresponding to each vertex v of G such that N(v) = N(v ′ ), where N(v) and N(v ′ ) are neighborhood sets of v and v ′ , respectively.The average lower independenceis the minimum cardinality of a maximal independent set that contains v.In this paper, we consider the average lower independence number in splitting graph.We determine the average lower independence number of S ′ (G) for specific graphs G.