Proving Spectrums: K6-$\lambda$I Matrix Trace

Click For Summary

Homework Help Overview

The discussion revolves around the spectral properties of the complete graph K6, particularly focusing on the trace of the matrix K6 - λI. Participants are exploring concepts from spectral graph theory and matrix analysis.

Discussion Character

  • Exploratory, Conceptual clarification, Mathematical reasoning, Assumption checking

Approaches and Questions Raised

  • Participants discuss the adjacency matrix for K6 and its relation to the all ones matrix J. There are inquiries about computing the spectrum of J and the implications of the trace in this context. Some participants express uncertainty about the direction of their solutions and the relevance of spectral information in their calculations.

Discussion Status

The discussion is active, with participants sharing their attempts and seeking clarification on their approaches. Some guidance has been offered regarding the spectral properties of matrices, but there is no explicit consensus on the methods being used or the interpretations of the results.

Contextual Notes

There are indications of confusion regarding the application of spectral information to count edges and triangles, as well as the nature of the course material being discussed. Participants are navigating between different approaches and assumptions related to spectral graph theory.

Lauren1234
Messages
26
Reaction score
3
Homework Statement
Consider the complete graph K6 (with 6 vertices).
a. Show that its spectrum is given by:
$σ(K6) = {[−1]^5, [5]}$
b. Use the spectrum given in [a.] to calculate the number of edges and triangles in K6
Relevant Equations
N/a
This is my solution so far however I’m not sure where to go from here I think it’s something to do with the trace of the matrix but. This is the full solution but I did row reduction on the matrix K6- $lambda$I
 

Attachments

  • F1DF6B7B-7898-46F3-8DD7-28A3EFB448C1.png
    F1DF6B7B-7898-46F3-8DD7-28A3EFB448C1.png
    20.1 KB · Views: 232
Physics news on Phys.org
so the adjacency matrix for ##K_6 = \mathbf {11}^T - I_6 = J - I##. Can you compute the spectrum for ##J## (i.e. the all ones matrix)? Hint this is rank one, and the trace would be helpful here... after that you should know that for any matrix square matrix ##B## the new matrix ##B-I## has eigenvalues shifted down by one, why?

You can consider ##\text{trace}\big(K_6^m\big)## for well chosen $m$ for your part b.

I take it your problems are from a spectral graph theory course or perhaps general graph theory?
 
Hi thank you I think I managed to work it out I got 15 edges and 20 triangles using a formula I found!
 
StoneTemplePython said:
so the adjacency matrix for ##K_6 = \mathbf {11}^T - I_6 = J - I##. Can you compute the spectrum for ##J## (i.e. the all ones matrix)? Hint this is rank one, and the trace would be helpful here... after that you should know that for any matrix square matrix ##B## the new matrix ##B-I## has eigenvalues shifted down by one, why?

You can consider ##\text{trace}\big(K_6^m\big)## for well chosen $m$ for your part b.

I take it your problems are from a spectral graph theory course or perhaps general graph theory?
However the next part would you mind seeing if I’m on the correct lines it’s the same thing just for kn
 

Attachments

  • image.jpg
    image.jpg
    40.1 KB · Views: 186
I guess I'm not really sure what you're trying to do here. I thought you were going to use spectral information to find number of edges and triangles. But you said you're using formulas you found somewhere one of which uses spectral information and one doesn't. You didn't answer what kind of class this is for...
 

Similar threads

  • · Replies 2 ·
Replies
2
Views
1K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 25 ·
Replies
25
Views
4K
  • · Replies 5 ·
Replies
5
Views
14K
Replies
3
Views
2K
Replies
4
Views
2K
  • · Replies 3 ·
Replies
3
Views
3K
Replies
5
Views
2K
Replies
4
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K