When does the adjacency matrix $A$ of an undirected graph $G$ not have full rank? Is there any intuition to understanding this?
- Anybody can ask a question
- Anybody can answer
- The best answers are voted up and rise to the top
See the paper by Irene Sciriha, A characterization of singular graphs, Electronic Journal of Linear Algebra, Volume 16, pp. 451-462, December 2007, available at a URL I can't post because when I try I get the error message,
Oops! Your answer couldn't be submitted because:
Your post contains a link to the invalid host '184.108.40.206'. Please correct it by specifying a non numeric domain or wrapping it in a code block.
Anyway, it has that numeric domain, then journals/ELA/ela-articles/articles/vol16_pp451-462.pdf