Learn · Introduction to Algebraic Graph Theory
Lecture 42 of 48Week 8
Sign Switching in Signed Graphs
Prof. Ranveer Singh · IIT Indore
Credits and licence
- From
- Introduction to Algebraic Graph Theory, IIT Indore (at NPTEL)
- Licence
- CC BY-NC-SA, as NPTEL states it. Non-commercial use only.
- Attribution
- NPTEL states: "Distributed under Creative Commons Attribution-ShareAlike / CC BY - NC - SA", beside a BY-NC-SA badge. Coordinated by IIT Madras.
- Who can watch
- Tweens profiles and older. How courses are placed
All the lectures
- Warm-up with graphs
- Incidence matrix, cofactors of the Laplacian matrix (towards Matrix-Tree Theorem)
- Determinant of submatrices of incidence matrices and characterization of spanning trees
- Cauchy-Binet theorem and the proof of matrix-tree theorem
- Rank of incidence matrix and the number of connected components
- Rank and acyclic graphs, 0-1 incidence matrix and characterization of bipartite graph
- Introduction of the eigenvalues and eigenvector
- Adjacency matrix and number of walks; powers of a symmetric matrix
- The spectral theorem
- Rayleigh quotient and the eigenvalues
- A bound on the diameter of a graph using the number of distinct eigenvalues
- The rank of a symmetric matrix equals the number of nonzero eigenvalues.
- Perron-Frobenius theorem for nonnegative symmetric matrices
- The consequences of the Perron-Frobenius theorem (the properties of the largest eigenvalue and the corresponding eigenvectors)
- Eigenvalues of a graph and its subgraph; a relation between the largest eigenvalue and the degree(s)
- Cauchy interlace theorem
- Bipartite graphs and their eigenvalues
- Positive semi-definite matrices and the eigenvalues of their partitioned form
- The eigenvalues of a symmetric matrix in partitioned form
- Bounds on chromatic number, clique number, and independence number
- Introduction to lazy random walk, walk matrix
- Convergence of lazy random walk
- Rate of convergence of lazy random walk
- Regular graphs, spectral properties, bound on size of independent set
- Strongly regular graphs, their eigenvalues, and characterization
- The friendship theorem
- Introduction to cospectral graphs
- Godsil McKay switching to generate cospectral graphs
- Cartesian product and their eigenvalues, Shrikhande graph
- Graph determined by the spectrum
- Sensitivity, block sensitivity and hypercube graph
- Proof of sensitivity conjecture
- Introduction to expander graphs
- A lower bound on Cheeger constant, and expander mixing lemma
- Introduction to Ramanujan graphs
- 2-Lift and Zig-zag product for construction of expander and Ramanujan graphs
- Introduction of algebraic connectivity and Fiedler vector
- Upper bound on algebraic connectivity
- Some more bounds on algebraic connectivity
- Relation between algebraic connectivity of graph and its induced subgraph.
- Introduction to Balanced Signed Graphs
- Sign Switching in Signed Graphs
- Laplacian of Signed Graphs, Frustration number and Frustration index
- Determinant, Permanent in terms of graph structure.
- Live Session 27-08-2025
- Live Session 06-09-2025
- Live Session 22-09-2025
- Live Session 31-10-2025