 |
SOLUTIONS
|
|
|
|
||
|
|
| COMBINATORICA PACKAGE SYMBOL | Tutorials »|See Also »|More About » |
 lists the vertex equivalence classes between graphs  and  defined by their vertex degrees. |
| Equivalences[g] lists the vertex equivalences for graph  defined by the vertex degrees. |
 and  can also be used, where  are functions that compute other vertex invariants. It is expected that for each function  , the call  returns the corresponding invariant at vertex  in graph  . The functions  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. |
, you first need to load the Combinatorica Package using 
.
|
Choose Language
  |
