lists the vertex equivalence classes between graphs g and h defined by their vertex degrees.
lists the vertex equivalences for graph g defined by the vertex degrees.
Equivalences[g,h,f1,f2,…] and Equivalences[g,f1,f2,…]
can also be used, where f1,f2,… are functions that compute other vertex invariants. It is expected that for each function fi, the call fi[g,v] returns the corresponding invariant at vertex v in graph g. The functions f1,f2,… are evaluated in order, and the evaluation stops either when all functions have been evaluated or when an empty equivalence class is found. Three vertex invariants, DegreesOf2Neighborhood, NumberOf2Paths, and Distances are Combinatorica functions and can be used to refine the equivalences.
- Graph Algorithms
- Combinatorica Package
- Graph Construction and Representations
- Graphs & Networks
- Graph Visualization
- Computation on Graphs
- Graph Construction & Representation
- Graphs and Matrices
- Graph Properties & Measurements
- Graph Operations and Modifications
- Statistical Analysis
- Social Network Analysis
- Graph Properties
- Mathematical Data Formats
- Discrete Mathematics