Skip to main content
MathOverflow
Dominik Sieber's user avatar
Dominik Sieber's user avatar
Dominik Sieber's user avatar
Dominik Sieber
  • Member for 9 years, 6 months
  • Last seen more than 8 years ago
Profile Activity

7 Actions

All Accepts Posts Badges Comments Revisions Reviews Suggestions
comment
Generate all non-isomorphic partitions $\pi = \{ \{1, ..., n-1\}, \{n\} \}$ for all graphs of order $n$
Thank you! The sequence A126100 in the OEIS helped me a lot.
comment
Generate all non-isomorphic partitions $\pi = \{ \{1, ..., n-1\}, \{n\} \}$ for all graphs of order $n$
Thank you both so much! I am interested in a leader-follower consensus problem as described in here. I want to run some complete simulations for $n\leq10$ to get a quantitative statement about the uncontrollable subspaces for small graphs.
accepted
Generate all non-isomorphic partitions $\pi = \{ \{1, ..., n-1\}, \{n\} \}$ for all graphs of order $n$
awarded
 Scholar
awarded
 Student
asked
Generate all non-isomorphic partitions $\pi = \{ \{1, ..., n-1\}, \{n\} \}$ for all graphs of order $n$
awarded
 Informed