Page not found
This question was removed from MathOverflow for reasons of moderation. Please refer to the help center for possible explanations why a question might be removed.
Here are some similar questions that might be relevant:
- Is there an "adjacency matrix" for weighted directed graphs that captures the weights?
- Measuring how "heavily linked" a node is in a graph
- Is there a standard notation for binary relations in category theory?
- Regular graph colorings
- How to count 2-2 regular directed graphs with n vertices?
- Notation for "the" left adjoint functor
- Factorization of the characteristic polynomial of the adjacency matrix of a graph
Try a Google Search
Try searching for similar questions
Browse our recent questions
Browse our popular tags
If you feel something is missing that should be here, contact us.