AbstractLet Un,d denote the set of unicyclic graphs with a given diameter d. In this paper, the unique unicyclic graph in Un,d with the maximum number of independent sets, is characterized
Let i(G) be the number of independent sets in a graph G. We show that if G has maximum degree at mos...
AbstractA subset S⊆V(G) is independent if no two vertices of S are adjacent in G. In this paper we s...
AbstractIn this paper we prove that for every positive integer n there exist a bipartite graph with ...
AbstractLet Un,d denote the set of unicyclic graphs with a given diameter d. In this paper, the uniq...
AbstractIn this paper, we determine upper and lower bounds for the number of independent sets in a u...
AbstractIn this paper, we determine the maximum number of maximal independent sets in a unicyclic co...
In this paper, we determine upper and lower bounds for the number of independent sets in a unicycl...
Abstract. We consider the number of vertex independent sets i(G). In general, the problem of determi...
AbstractThe Hosoya index z(G) of a graph G is defined as the number of matchings of G and the Merrif...
Wilf found the maximum number of independent dominating sets of a tree using algebraic methods, whil...
Let it (G) be the number of independent sets of size t in a graph G. Engbers and Galvin asked how la...
We consider numbers and sizes of independent sets in graphs with minimum degree at least $d$, when t...
We determine the maximum number of maximal independent sets which a connected graph on n vertices ca...
A maximal independent set is an independent set that is not a proper subset of any other independent...
AbstractWe determine the maximum number of maximal independent sets which a connected graph on n ver...
Let i(G) be the number of independent sets in a graph G. We show that if G has maximum degree at mos...
AbstractA subset S⊆V(G) is independent if no two vertices of S are adjacent in G. In this paper we s...
AbstractIn this paper we prove that for every positive integer n there exist a bipartite graph with ...
AbstractLet Un,d denote the set of unicyclic graphs with a given diameter d. In this paper, the uniq...
AbstractIn this paper, we determine upper and lower bounds for the number of independent sets in a u...
AbstractIn this paper, we determine the maximum number of maximal independent sets in a unicyclic co...
In this paper, we determine upper and lower bounds for the number of independent sets in a unicycl...
Abstract. We consider the number of vertex independent sets i(G). In general, the problem of determi...
AbstractThe Hosoya index z(G) of a graph G is defined as the number of matchings of G and the Merrif...
Wilf found the maximum number of independent dominating sets of a tree using algebraic methods, whil...
Let it (G) be the number of independent sets of size t in a graph G. Engbers and Galvin asked how la...
We consider numbers and sizes of independent sets in graphs with minimum degree at least $d$, when t...
We determine the maximum number of maximal independent sets which a connected graph on n vertices ca...
A maximal independent set is an independent set that is not a proper subset of any other independent...
AbstractWe determine the maximum number of maximal independent sets which a connected graph on n ver...
Let i(G) be the number of independent sets in a graph G. We show that if G has maximum degree at mos...
AbstractA subset S⊆V(G) is independent if no two vertices of S are adjacent in G. In this paper we s...
AbstractIn this paper we prove that for every positive integer n there exist a bipartite graph with ...
DOI
Add to ORKG