query: What properties does a graph whose adjacency matrix is invertible have?
positive_passages.docid: 19219
positive_passages.text: On the invertibility of the adjacency matrix of a graph
negative_passages.docid: 72417
negative_passages.text: Bipartite graphs
negative_passages.docid: 90256
negative_passages.text: Example of a simple graph isomorphic to a permutation group.
negative_passages.docid: 142307
negative_passages.text: Counting invertible $0$-$1$ matrices that remain invertible under negating the diagonal
negative_passages.docid: 46309
negative_passages.text: Prove that this graph is nonplanar
negative_passages.docid: 12060
negative_passages.text: Homeomorphism to graph
negative_passages.docid: 80751
negative_passages.text: diagonalisability of matrix few properties
negative_passages.docid: 83872
negative_passages.text: Isomorphisms for graphs with loops and multiple edges
negative_passages.docid: 22222
negative_passages.text: Properties of zero-diagonal symmetric matrices
negative_passages.docid: 84654
negative_passages.text: The graph of xy = 1 is connected or not
negative_passages.docid: 42367
negative_passages.text: Prove that simple graph $G$ is orientable
negative_passages.docid: 37122
negative_passages.text: Modifying some features on the graphs of a function and its inverse
negative_passages.docid: 146487
negative_passages.text: Can a non-square matrix be called "invertible"?
negative_passages.docid: 4517
negative_passages.text: Showing a $2\times2$ matrix is invertible
negative_passages.docid: 10042
negative_passages.text: How to Show that Linear transformation is invertible?
negative_passages.docid: 133573
negative_passages.text: characteristic polynomial of the adjacency matrix of a tree
negative_passages.docid: 27373
negative_passages.text: Graph Proof by induction.