Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with adjacency-matrices
Search options answers only
not deleted
user 9025
An adjacency matrix is a square (0,1)-matrix used to represent a graph. Its entries indicate whether pairs of vertices are adjacent or not.
1
vote
Adjacency matrix of total graph
If $C$ is the incidence matrix (rows indexed by vertices, columns by edges, two 1s in each column) then $CC^T$ is the Laplacian matrix and $C^TC-2I is the adjacency matrix of the linegraph. From this …
- 37.7k
1
vote
Which directed graphs have a normal adjacency matrix?
For $n=1,\ldots,8$, the number of isomorphism classes of normal loop-free digraphs is apparently 1, 2, 5, 15, 49, 232, 1413, 14961.
If loops are allowed, the counts for $n=1,\ldots,8$ are 2, 6, 22, 10 …
- 37.7k