A stable (or independent) set in a graph is a set of pairwise non-adjacent vertices. The
stability number α (G) is the size of a maximum stable set in the graph G. There are three …

A graph G is well-covered if all its maximal stable sets have the same size, denoted by α
(G)[MD Plummer, Some covering concepts in graphs, Journal of Combinatorial Theory 8 …

If 𝑠𝑘 equals the number of stable sets of cardinality k in the graph G, then
I\left(G;x\right)=∑k=0^α\left(G\right)s_kx^k is the independence polynomial of G (Gutman …

If s κ denotes the number of stable sets of cardinality κ in the graph G, then I (G; x)= ∑ k= 0^
α s_k x^ k is the independence polynomial of G (Gutman, Harary, 1983), where α= α (G) is …

A stable (or independent) set in a graph is a set of pairwise nonadjacent vertices thereof.
The stability numberα (G) is the maximum size of stable sets in a graph G. The …

A stable set in a graph G is a set of pairwise non-adjacent vertices, and the stability number
α (G) is the maximum size of a stable set in G. The independence polynomial of G is I (G; x) …

Let α (G) be the cardinality of a largest independent set in graph G. If sk is the number of
independent sets of size k in G, then I (G; x)= s 0+ s 1 x+⋯+ s α x α, α= α (G), is the …

Maximal trees with log-concave independence polynomials Page 1 Notes on Number Theory
and Discrete Mathematics Print ISSN 1310–5132, Online ISSN 2367–8275 Vol. 22, 2016, No …

Let $ G $ be a $\mathbf {W} _ {p} $ graph if $ n\geq p $ and every $ p $ pairwise disjoint
independent sets of $ G $ are contained within $ p $ pairwise disjoint maximum …

A graph with at most two vertices of the same degree is known as antiregular [Merris, R.,
Antiregular graphs are universal for trees, Publ. Electrotehn. Fak. Univ. Beograd, Sen Mat …