Help! I'm Struggling with Graph Theory Exam!

AI Thread Summary
Struggling with graph theory, the user seeks clarity on calculating eigenvalues of adjacency matrices, particularly in relation to a professor's question about the sum of elements in a specific row. They express confusion over their lecture notes and the connection between eigenvalues and the adjacency matrix. The discussion confirms that the graphs in question are undirected and do not allow loops. A resource from Berkeley is shared, containing theorems on eigenvalues that may assist in understanding. Overall, the user is looking for additional resources and clarification on these concepts.
Niels
Messages
10
Reaction score
0
I'm having an exam on graph theory next week and I'm having some problem with understanding the meaning of calculating eigenvalues of adjacency matrices for graphs. My notes suck from the lectures and I'm totally lost...

Our professor asked "What is the sum of elements in row k of the adjacency matrix?" and showed an example where he calculated the eigenvalues of C_3 (2, -1, -1) but then my notes stop and and I can't connect the eigenvalues to the question...

Any input on this subject most welcome... Any one know any good resource on the net where I can find more on this??
 
Last edited:
Mathematics news on Phys.org
I don't know of websites on that topic, though I don't doubt there are some.

Out of curiosity, in connection with your problem, are the graphs understood to be undirected? Can a node be adjacent to itself, i.e. are "loops" allowed in the type of graph you are talking about? I am pretty sure that different authors put different restrictions on the properties of a graph when defining that term.
 
The graphs are undirected without loops...
 
Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...
Fermat's Last Theorem has long been one of the most famous mathematical problems, and is now one of the most famous theorems. It simply states that the equation $$ a^n+b^n=c^n $$ has no solutions with positive integers if ##n>2.## It was named after Pierre de Fermat (1607-1665). The problem itself stems from the book Arithmetica by Diophantus of Alexandria. It gained popularity because Fermat noted in his copy "Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et...
Thread 'Imaginary Pythagorus'
I posted this in the Lame Math thread, but it's got me thinking. Is there any validity to this? Or is it really just a mathematical trick? Naively, I see that i2 + plus 12 does equal zero2. But does this have a meaning? I know one can treat the imaginary number line as just another axis like the reals, but does that mean this does represent a triangle in the complex plane with a hypotenuse of length zero? Ibix offered a rendering of the diagram using what I assume is matrix* notation...
Back
Top