1
$\begingroup$

Given a set $S$, how can we classify different graphs $G(S)$ (tree, connected/disconnected, ...) based on the patterns of the 1's and 0's in their adjacency matrices $M(G(S))$?

  • 0
    @DayLateDon That's wasn't a glitch--I was indeed clicking the button repeatedly. From now on I will try to click less o$f$ten.2012-06-20

0 Answers 0