An Optimized Algorithm to Determine The Eigenvalues From a Graphic Sequence by Constructing a Symmetric Matrix
摘要：Spectral graph theory is a popular topic in modern day applied mathematics. Determining the eigenvalues of a given graph gives us an in-depth idea about some interesting properties of the graph. A finite sequence of nonnegative integers is said to be graphical if there exists a finite simple graph, such that the degrees of its vertices corresponds to the terms of the sequence. Such a graph is often termed as a realization of the given degree sequence. In this paper we have proposed an algorithm that determines the realization of a given degree sequence by constructing the adjacency matrix from the given sequence. Further we utilize the adjacency matrix thus obtained to determine the eigenvalues of the graph.
2015 2nd International Conference on World Islamic Studies
Seoul, South Korea