Independently saturated graphs
Citation
Berberler, Z. N. & Berberler, M. E. (2018). Independently saturated graphs. TWMS Journal Of Applied And Engineering Mathematics, 8(1), 44-50.Abstract
The independence saturation number IS(G) of a graph G = (V, E) is defined as min{IS(V ) : v ? V } , where IS(v) is the maximum cardinality of an independent set that contains v. In this paper, we consider and compute exact formulae for the independence saturation in specific graph families and composite graphs.
Volume
8Issue
1URI
http://belgelik.isikun.edu.tr/xmlui/handle/iubelgelik/2642http://jaem.isikun.edu.tr/web/index.php/archive/97-vol8no1/320
Collections
The following license files are associated with this item:
Except where otherwise noted, this item's license is described as info:eu-repo/semantics/openAccess
