VERTEX VULNERABILITY PARAMETER OF GEAR GRAPHS
Makaleler > Tam Makale · 2011
Yazarlar: Aysun AYTAÇ, Tufan TURACI
International Journal of Foundations of Computer Science, SCI Expanded İndekslerine Giren Dergi, Uluslararası, Wos, 2011, cilt 22, ss 1187-1195
DOI: 10.1142/s0129054111008635
Özet
For a vertex v of a graph G = (V,E), the independent domination number (also called the lower independence number) iv(G) of G relative to v is the minimum cardinality of a maximal independent set in G that contains v. The average lower independence number of G is [Formula: see text]. In this paper, this parameter is defined and examined, also the average lower independence number of gear graphs is considered. Then, an algorithm for the average lower independence number of any graph is offered.