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
AbstractLet G=(V,E) be a graph and k⩾2 be an integer. A set S⊂V is k-independent if every component ...
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 ...
In this paper we give a generalization of the Pell numbers and the Pell-Lucas numbers and next we ap...
AbstractIn this paper we give a generalization of known sequences and then we give their graph repre...
AbstractIn this paper, we give a new interpretation of the generalized Fibonacci numbers and the gen...
AbstractA subset S⊆V(G) is independent if no two vertices of S are adjacent in G. In this paper we s...
The paper deals with some generalizations of Fibonacci and Lucas sequences, arising from powers of p...
The Fibonacci number ℱ(G) of a graph G with vertex set V(G), is the total number of independent vert...
The paper deals with some generalizations of Fibonacci and Lucas sequences, arising from powers of p...
AbstractThe Fibonacci number ℱ(G) of a graph G with vertex set V(G), is the total number of independ...
Special number sequences play important role in many areas of science. One of them named as Fibonacc...
This paper generalizes a graph theoretic proof technique for a Fibonacci identity proposed by Lee Kn...
AbstractIn [G. Hopkins, W. Staton, Some identities arising from the Fibonacci numbers of certain gra...
In the master's thesis we are dealing with the independence number of a graph. We show, that the wel...
AbstractLet G=(V,E) be a graph and k⩾2 be an integer. A set S⊂V is k-independent if every component ...
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 ...
In this paper we give a generalization of the Pell numbers and the Pell-Lucas numbers and next we ap...
AbstractIn this paper we give a generalization of known sequences and then we give their graph repre...
AbstractIn this paper, we give a new interpretation of the generalized Fibonacci numbers and the gen...
AbstractA subset S⊆V(G) is independent if no two vertices of S are adjacent in G. In this paper we s...
The paper deals with some generalizations of Fibonacci and Lucas sequences, arising from powers of p...
The Fibonacci number ℱ(G) of a graph G with vertex set V(G), is the total number of independent vert...
The paper deals with some generalizations of Fibonacci and Lucas sequences, arising from powers of p...
AbstractThe Fibonacci number ℱ(G) of a graph G with vertex set V(G), is the total number of independ...
Special number sequences play important role in many areas of science. One of them named as Fibonacc...
This paper generalizes a graph theoretic proof technique for a Fibonacci identity proposed by Lee Kn...
AbstractIn [G. Hopkins, W. Staton, Some identities arising from the Fibonacci numbers of certain gra...
In the master's thesis we are dealing with the independence number of a graph. We show, that the wel...
AbstractLet G=(V,E) be a graph and k⩾2 be an integer. A set S⊂V is k-independent if every component ...
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 ...
DOI
Add to ORKG