AbstractA subset S⊆V(G) is independent if no two vertices of S are adjacent in G. In this paper we study the number of independent sets in graphs with two elementary cycles. In particular we determine the smallest number and the largest number of these sets among n-vertex graphs with two elementary cycles. The extremal values of the number of independent sets are described using Fibonacci numbers and Lucas numbers
AbstractLet Un,d denote the set of unicyclic graphs with a given diameter d. In this paper, the uniq...
In the master's thesis we are dealing with the independence number of a graph. We show, that the wel...
We consider the number of vertex independent sets i(G)In general, the problem of determining the val...
AbstractA subset S⊆V(G) is independent if no two vertices of S are adjacent in G. In this paper we s...
The Fibonacci number ℱ(G) of a graph G with vertex set V(G), is the total number of independent vert...
AbstractThe Fibonacci number ℱ(G) of a graph G with vertex set V(G), is the total number of independ...
Abstract. We consider the number of vertex independent sets i(G). In general, the problem of determi...
AbstractIn this paper, we determine upper and lower bounds for the number of independent sets in a u...
In this paper, we determine upper and lower bounds for the number of independent sets in a unicycl...
AbstractIn this paper we give a generalization of known sequences and then we give their graph repre...
We consider numbers and sizes of independent sets in graphs with minimum degree at least $d$, when t...
Given a graph G, an independent set I(G) is a subset of the vertices of G such that no two vertices ...
Given a graph G, an independent set I(G) is a subset of the vertices of G such that no two vertices ...
AbstractA set of vertices S in a graph G is independent if no neighbor of a vertex of S belongs to S...
Let i(G) be the number of independent sets in a graph G. We show that if G has maximum degree at mos...
AbstractLet Un,d denote the set of unicyclic graphs with a given diameter d. In this paper, the uniq...
In the master's thesis we are dealing with the independence number of a graph. We show, that the wel...
We consider the number of vertex independent sets i(G)In general, the problem of determining the val...
AbstractA subset S⊆V(G) is independent if no two vertices of S are adjacent in G. In this paper we s...
The Fibonacci number ℱ(G) of a graph G with vertex set V(G), is the total number of independent vert...
AbstractThe Fibonacci number ℱ(G) of a graph G with vertex set V(G), is the total number of independ...
Abstract. We consider the number of vertex independent sets i(G). In general, the problem of determi...
AbstractIn this paper, we determine upper and lower bounds for the number of independent sets in a u...
In this paper, we determine upper and lower bounds for the number of independent sets in a unicycl...
AbstractIn this paper we give a generalization of known sequences and then we give their graph repre...
We consider numbers and sizes of independent sets in graphs with minimum degree at least $d$, when t...
Given a graph G, an independent set I(G) is a subset of the vertices of G such that no two vertices ...
Given a graph G, an independent set I(G) is a subset of the vertices of G such that no two vertices ...
AbstractA set of vertices S in a graph G is independent if no neighbor of a vertex of S belongs to S...
Let i(G) be the number of independent sets in a graph G. We show that if G has maximum degree at mos...
AbstractLet Un,d denote the set of unicyclic graphs with a given diameter d. In this paper, the uniq...
In the master's thesis we are dealing with the independence number of a graph. We show, that the wel...
We consider the number of vertex independent sets i(G)In general, the problem of determining the val...
DOI
Add to ORKG