Finding Eigen Values For Banana Tree |
Author(s): |
| R.Malathi , SCSVMV |
Keywords: |
| Graph, Banana tree, Edge, vertex, Adjacency matrix, Eigen values |
Abstract |
|
In the mathematical field of graphs theory. The fact is that graphs serves as mathematical model for any system involving binary relation. The field of graph theory play vital role in various field.one of the areas in graph theory is finding Eigen value for banana tree. The banana tree graphs Bn,k is the graphs obtained by connecting one leaf of each of n-copies of a K-star graph with a single root vertex that is distinct of all the stars. The Bn,k has order nk+1 and size nk. We present results about one important Eigen value for banana tree. We find the Eigen value through adjacency matrix for Bn,k. In this paper we present result about Eigen value of banana graphs Bn,k. we show that Eigen value through adjacency matrix of banana tree Bn,k. |
Other Details |
|
Paper ID: IJSRDV7I120052 Published in: Volume : 7, Issue : 12 Publication Date: 01/03/2020 Page(s): 686-689 |
Article Preview |
|
|
|
|
