One or two branded graphs are isomorphic when they represent the same topological relationships
One or two branded graphs are isomorphic when they represent the same topological relationships The degree sequence of a graph is a list (in decreasing order) of the number of relationships of each person in the graph. In the case of Alice, John, Bob, Mary and Sean, it’s <2,1,1,1,1>. (Alice has two relationships, everyone else […]