Combinatorics and Graph Theory

   

The Complete Graph: Eigenvalues, Trigonometrical Unit-Equations with Associated T-Complete-Eigen Sequences, Ratios, Sums and Diagrams

Authors: Paul August Winter, Carol Lynne Jessop, Fadekemi Janet Adewusi

The complete graph is often used to verify certain graph theoretical definitions and applications. Regarding the adjacency matrix, associated with the complete graph, as a circulant matrix, we find its eigenvalues, and use this result to generate a trigonometrical unit-equations involving the sum of terms of the form , where a is odd. This gives rise to t-complete-eigen sequences and diagrams, similar to the famous Farey sequence and diagram. We show that the ratio, involving sum of the terms of the t-complete eigen sequence, converges to ½ , and use this ratio to find the t-complete eigen area. To find the eigenvalues, associated with the characteristic polynomial of complete graph, using induction, we create a general determinant equation involving the minor of the matrix associated with this characteristic polynomial.

Comments: 20 Pages.

Download: PDF

Submission history

[v1] 2014-11-19 05:12:27

Unique-IP document downloads: 83 times

Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.

comments powered by Disqus