Arithmetically maximal independent sets in infinite graphs
Stanisław Bylka (2005)
Discussiones Mathematicae Graph Theory
Similarity:
Families of all sets of independent vertices in graphs are investigated. The problem how to characterize those infinite graphs which have arithmetically maximal independent sets is posed. A positive answer is given to the following classes of infinite graphs: bipartite graphs, line graphs and graphs having locally infinite clique-cover of vertices. Some counter examples are presented.