A124059
Number of connected asymmetric graphs with n nodes.
Original entry on oeis.org
1, 0, 0, 0, 0, 8, 144, 3552, 131452, 7840396, 797524380, 143325597564
Offset: 1
- C. O. Aguilar and B. Gharesifard, Graph Controllability Classes for the Laplacian Leader-Follower Dynamics, 2014. See Table 1.
- Ernesto Estrada, Communicability cosine distance: similarity and symmetry in graphs/networks, hal-04169459 [math], 2023. See p. 22.
- N. J. A. Sloane, Transforms
- Yoav Spector, Moshe Schwartz, Study of potential Hamiltonians for quantum graphity, arXiv:1808.05632 [cond-mat.stat-mech], 2018.
- Eric Weisstein's World of Mathematics, Graph Automorphism
- Eric Weisstein's World of Mathematics, Identity Graph
- Myung-Gon Yoon, Peter Rowlinson, Dragos Cvetkovic, and Zoran Stanic, Controllability of multi-agent dynamical systems with a broadcasting control signal, Asian J. Control 16 (4) (2014) 1066-1072, Table 1
Cf.
A003400 (not-necessarily connected simple asymmetric graphs).
Cf.
A275867 (disconnected simple asymmetric graphs).
Cf. Values of |Aut(g)| for simple connected graphs,
A124059,
A241454,
A241455,
A241456,
A241457,
A241458,
A241459,
A241460,
A241461,
A241462,
A241463,
A241464,
A241465,
A241466,
A241467,
A241468,
A241469,
A241470,
A241471.
A241455
Number of simple connected graphs g on n nodes with |Aut(g)| = 4.
Original entry on oeis.org
0, 0, 0, 1, 3, 28, 198, 1971, 29047, 672516
Offset: 1
Cf. Values of |Aut(g)| for simple connected graphs,
A124059,
A241454,
A241455,
A241456,
A241457,
A241458,
A241459,
A241460,
A241461,
A241462,
A241463,
A241464,
A241465,
A241466,
A241467,
A241468,
A241469,
A241470,
A241471.
A241456
Number of simple connected graphs g on n nodes with |Aut(g)| = 6.
Original entry on oeis.org
0, 0, 1, 1, 1, 7, 31, 221, 3025, 68033
Offset: 1
Cf. Values of |Aut(g)| for simple connected graphs,
A124059,
A241454,
A241455,
A241456,
A241457,
A241458,
A241459,
A241460,
A241461,
A241462,
A241463,
A241464,
A241465,
A241466,
A241467,
A241468,
A241469,
A241470,
A241471.
A241457
Number of simple connected graphs g on n nodes with |Aut(g)| = 8.
Original entry on oeis.org
0, 0, 0, 1, 2, 9, 55, 499, 6017, 107312
Offset: 1
Cf. Values of |Aut(g)| for simple connected graphs,
A124059,
A241454,
A241455,
A241456,
A241457,
A241458,
A241459,
A241460,
A241461,
A241462,
A241463,
A241464,
A241465,
A241466,
A241467,
A241468,
A241469,
A241470,
A241471.
A241458
Number of simple connected graphs g on n nodes with |Aut(g)| = 10.
Original entry on oeis.org
0, 0, 0, 0, 1, 1, 1, 3, 13, 123
Offset: 1
Cf. Values of |Aut(g)| for simple connected graphs,
A124059,
A241454,
A241455,
A241456,
A241457,
A241458,
A241459,
A241460,
A241461,
A241462,
A241463,
A241464,
A241465,
A241466,
A241467,
A241468,
A241469,
A241470,
A241471.
A241459
Number of simple connected graphs g on n nodes with |Aut(g)| = 12.
Original entry on oeis.org
0, 0, 0, 0, 3, 10, 51, 356, 3395, 49862
Offset: 1
Cf. Values of |Aut(g)| for simple connected graphs,
A124059,
A241454,
A241455,
A241456,
A241457,
A241458,
A241459,
A241460,
A241461,
A241462,
A241463,
A241464,
A241465,
A241466,
A241467,
A241468,
A241469,
A241470,
A241471.
A241460
Number of simple connected graphs g on n nodes with |Aut(g)| = 14.
Original entry on oeis.org
0, 0, 0, 0, 0, 0, 2, 2, 2, 6
Offset: 1
Cf. Values of |Aut(g)| for simple connected graphs,
A124059,
A241454,
A241455,
A241456,
A241457,
A241458,
A241459,
A241460,
A241461,
A241462,
A241463,
A241464,
A241465,
A241466,
A241467,
A241468,
A241469,
A241470,
A241471.
A241461
Number of simple connected graphs g on n nodes with |Aut(g)| = 16.
Original entry on oeis.org
0, 0, 0, 0, 0, 3, 10, 123, 992, 14026
Offset: 1
Cf. Values of |Aut(g)| for simple connected graphs,
A124059,
A241454,
A241455,
A241456,
A241457,
A241458,
A241459,
A241460,
A241461,
A241462,
A241463,
A241464,
A241465,
A241466,
A241467,
A241468,
A241469,
A241470,
A241471.
A241462
Number of simple connected graphs g on n nodes with |Aut(g)| = 20.
Original entry on oeis.org
0, 0, 0, 0, 0, 0, 2, 6, 29, 199
Offset: 1
Cf. Values of |Aut(g)| for simple connected graphs,
A124059,
A241454,
A241455,
A241456,
A241457,
A241458,
A241459,
A241460,
A241461,
A241462,
A241463,
A241464,
A241465,
A241466,
A241467,
A241468,
A241469,
A241470,
A241471.
A241463
Number of simple connected graphs g on n nodes with |Aut(g)| = 24.
Original entry on oeis.org
0, 0, 0, 1, 1, 1, 14, 118, 1247, 17191
Offset: 1
Cf. Values of |Aut(g)| for simple connected graphs,
A124059,
A241454,
A241455,
A241456,
A241457,
A241458,
A241459,
A241460,
A241461,
A241462,
A241463,
A241464,
A241465,
A241466,
A241467,
A241468,
A241469,
A241470,
A241471.
Showing 1-10 of 23 results.
Comments