Abstract
ABSTRACT The symmetric Pascal matrix is a square matrix whose entries are given by binomial coefficients modulo 2. In 1997, Christopher and Kennedy defined and studied the binomial graph, which is the graph whose adjacency matrix is the symmetric Pascal matrix. They computed the spectrum of the binomial graph of order a power of 2. In this paper, we study spectral properties of the binomial graph of any order such as eigenvalues and eigenvectors, algebraic connectivities and inertia indices. We also compute the determinant of the symmetric Pascal matrix in modulo 3.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
