AbstractIn this paper we give a generalization of known sequences and then we give their graph representations. We generalize Fibonacci numbers, Lucas numbers, Pell numbers, Tribonacci numbers and we prove that they are equal to the total number of k-independent sets in special graphs
AbstractWrite I(G) for the set of independent sets of a graph G and i(G) for |I(G)|. It has been con...
In this paper, we determine upper and lower bounds for the number of independent sets in a unicycl...
AbstractLet it(G) denote the number of independent sets of size t in a graph G. Levit and Mandrescu ...
AbstractIn this paper we give a generalization of known sequences and then we give their graph repre...
AbstractA subset S⊆V(G) is independent if no two vertices of S are adjacent in G. In this paper we s...
AbstractThe Fibonacci number ℱ(G) of a graph G with vertex set V(G), is the total number of independ...
AbstractIn this paper, we give a new interpretation of the generalized Fibonacci numbers and the gen...
In 1982, Prodinger and Tichy defined the Fibonacci number of a graph G to be the number of independe...
AbstractAn independent set of a graph G is a set of pairwise non-adjacent vertices. Let α(G) denote ...
AbstractLet Tn be the class of tricyclic graphs G on n vertices. In this work, the graphs in Tn with...
AbstractIn this paper, we determine upper and lower bounds for the number of independent sets in a u...
AbstractIn [G. Hopkins, W. Staton, Some identities arising from the Fibonacci numbers of certain gra...
AbstractAn independent set of a graph G is a set of pairwise non-adjacent vertices. G is well-covere...
The Fibonacci number ℱ(G) of a graph G with vertex set V(G), is the total number of independent vert...
AbstractNew upper bounds for the number of independent sets in graphs are obtained
AbstractWrite I(G) for the set of independent sets of a graph G and i(G) for |I(G)|. It has been con...
In this paper, we determine upper and lower bounds for the number of independent sets in a unicycl...
AbstractLet it(G) denote the number of independent sets of size t in a graph G. Levit and Mandrescu ...
AbstractIn this paper we give a generalization of known sequences and then we give their graph repre...
AbstractA subset S⊆V(G) is independent if no two vertices of S are adjacent in G. In this paper we s...
AbstractThe Fibonacci number ℱ(G) of a graph G with vertex set V(G), is the total number of independ...
AbstractIn this paper, we give a new interpretation of the generalized Fibonacci numbers and the gen...
In 1982, Prodinger and Tichy defined the Fibonacci number of a graph G to be the number of independe...
AbstractAn independent set of a graph G is a set of pairwise non-adjacent vertices. Let α(G) denote ...
AbstractLet Tn be the class of tricyclic graphs G on n vertices. In this work, the graphs in Tn with...
AbstractIn this paper, we determine upper and lower bounds for the number of independent sets in a u...
AbstractIn [G. Hopkins, W. Staton, Some identities arising from the Fibonacci numbers of certain gra...
AbstractAn independent set of a graph G is a set of pairwise non-adjacent vertices. G is well-covere...
The Fibonacci number ℱ(G) of a graph G with vertex set V(G), is the total number of independent vert...
AbstractNew upper bounds for the number of independent sets in graphs are obtained
AbstractWrite I(G) for the set of independent sets of a graph G and i(G) for |I(G)|. It has been con...
In this paper, we determine upper and lower bounds for the number of independent sets in a unicycl...
AbstractLet it(G) denote the number of independent sets of size t in a graph G. Levit and Mandrescu ...
DOI
Add to ORKG