Tribonacci graphs

Abstract

Special numbers have very important mathematical properties alongside their numerous applications in many fields of science. Probably the most important of those is the Fibonacci numbers. In this paper, we use a generalization of Fibonacci numbers called tribonacci numbers having very limited properties and relations compared to Fibonacci numbers. There is almost no result on the connections between these numbers and graphs. A graph having a degree sequence consisting of t successive tribonacci numbers is called a tribonacci graph of order t. Recently, a new graph parameter named as omega invariant has been introduced and shown to be very informative in obtaining combinatorial and topological properties of graphs. It is useful for graphs having the same degree sequence and gives some common properties of the realizations of this degree sequence together with some properties especially connectedness and cyclicness of all realizations. In this work, we determined all the tribonacci graphs of any order by means of some combinatorial results. Those results should be useful in networks with large degree sequences and cryptographic applications with special numbers.

Keywords

• tribonacci graph
• degree sequence
• fibonacci graph
• tribonacci number