cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-4 of 4 results.

A330297 Number of labeled simple graphs covering n vertices with exactly two automorphisms, or with exactly n!/2 graphs obtainable by permuting the vertices.

Original entry on oeis.org

0, 0, 1, 3, 24, 540, 13320
Offset: 0

Views

Author

Gus Wiseman, Dec 12 2019

Keywords

Comments

These are graphs with exactly one involution and no other symmetries.

Examples

			The a(4) = 24 graphs:
  {12,13,24}  {12,13,14,23}
  {12,13,34}  {12,13,14,24}
  {12,14,23}  {12,13,14,34}
  {12,14,34}  {12,13,23,24}
  {12,23,34}  {12,13,23,34}
  {12,24,34}  {12,14,23,24}
  {13,14,23}  {12,14,24,34}
  {13,14,24}  {12,23,24,34}
  {13,23,24}  {13,14,23,34}
  {13,24,34}  {13,14,24,34}
  {14,23,24}  {13,23,24,34}
  {14,23,34}  {14,23,24,34}

Links

Crossrefs

The non-covering version is A330345.
The unlabeled version is A330346 (not A241454).
Covering simple graphs are A006129.
Covering graphs with exactly one automorphism are A330343.
Graphs with exactly two automorphisms are A330297 (labeled covering), A330344 (unlabeled), A330345 (labeled), and A330346 (unlabeled covering).
Cf. A003400, A006125, A016031, A124059, A143543, A241454, A330098, A330229, A330230, A330231, A330233.

Programs

  • Mathematica
    graprms[m_]:=Union[Table[Sort[Sort/@(m/.Rule@@@Table[{p[[i]],i},{i,Length[p]}])],{p,Permutations[Union@@m]}]];
Table[Length[Select[Subsets[Subsets[Range[n],{2}]],Union@@#==Range[n]&&Length[graprms[#]]==n!/2&]],{n,0,5}]

Formula

a(n) = n!/2 * A330346(n).

A330344 Number of unlabeled graphs with n vertices whose covered portion has exactly two automorphisms.

Original entry on oeis.org

0, 1, 2, 4, 13, 50, 367
Offset: 1

Views

Author

Gus Wiseman, Dec 12 2019

Keywords

Examples

			Non-isomorphic representatives of the a(2) = 1 through a(5) = 13 graphs:
  {12}  {12}     {12}           {12}
        {12,13}  {12,13}        {12,13}
                 {12,13,24}     {12,13,24}
                 {12,13,14,23}  {12,13,14,23}
                                {12,13,14,25}
                                {12,13,24,35}
                                {12,13,14,23,25}
                                {12,13,14,23,45}
                                {12,13,15,24,34}
                                {12,13,14,15,23,24}
                                {12,13,14,23,24,35}
                                {12,13,14,23,25,45}
                                {12,13,14,15,23,24,35}

Crossrefs

The labeled version is A330345.
The covering case is A330346 (not A241454).
Unlabeled graphs are A000088.
Unlabeled graphs with exactly one automorphism are A003400.
Unlabeled connected graphs with exactly one automorphism are A124059.
Graphs with exactly two automorphisms are A330297 (labeled covering), A330344 (unlabeled), A330345 (labeled), and A330346 (unlabeled covering).
Cf. A000612, A004111, A055621, A241454, A283877, A330098, A330227, A330230, A330231, A330233, A330294, A330295.

Formula

Partial sums of A330346.

A330345 Number of labeled simple graphs with n vertices whose covered portion has exactly two automorphisms.

Original entry on oeis.org

0, 0, 1, 6, 42, 700, 16995
Offset: 0

Views

Author

Gus Wiseman, Dec 12 2019

Keywords

Examples

			The a(4) = 42 graphs:
  {12}  {12,13}  {12,13,24}  {12,13,14,23}
  {13}  {12,14}  {12,13,34}  {12,13,14,24}
  {14}  {12,23}  {12,14,23}  {12,13,14,34}
  {23}  {12,24}  {12,14,34}  {12,13,23,24}
  {24}  {13,14}  {12,23,34}  {12,13,23,34}
  {34}  {13,23}  {12,24,34}  {12,14,23,24}
        {13,34}  {13,14,23}  {12,14,24,34}
        {14,24}  {13,14,24}  {12,23,24,34}
        {14,34}  {13,23,24}  {13,14,23,34}
        {23,24}  {13,24,34}  {13,14,24,34}
        {23,34}  {14,23,24}  {13,23,24,34}
        {24,34}  {14,23,34}  {14,23,24,34}

Crossrefs

The unlabeled version is A330344.
The covering case is A330297.
Covering simple graphs are A006129.
Graphs with exactly two automorphisms are A330297 (labeled covering), A330344 (unlabeled), A330345 (labeled), A330346 (unlabeled covering), A241454 (unlabeled connected).
Cf. A006125, A143543, A330098, A330228, A330230, A330282, A330343.

Programs

  • Mathematica
    graprms[m_]:=Union[Table[Sort[Sort/@(m/.Rule@@@Table[{p[[i]],i},{i,Length[p]}])],{p,Permutations[Union@@m]}]];
Table[Length[Select[Subsets[Subsets[Range[n],{2}]],Length[graprms[#]]==Length[Union@@#]!/2&]],{n,0,4}]

A330343 Number of labeled fully chiral simple graphs (also called identity or asymmetric graphs) covering n vertices.

Original entry on oeis.org

1, 0, 0, 0, 0, 5760, 766080, 149022720, 48990251520, 28928242022400, 32147584690636800, 69035206021583155200
Offset: 1

Views

Author

Gus Wiseman, Dec 12 2019

Keywords

Comments

In a fully chiral graph, every permutation of the vertices gives a different representative, so the only automorphism is the identity.

Crossrefs

The unlabeled version is A003400.
Identity trees are A004111.
Covering simple graphs are A006129.
Full chiral integer partitions are A330228.
Fully chiral factorizations are A330235.
Fully chiral set-systems are A330229 (labeled covering), A330282 (labeled), A330294 (unlabeled), A330295 (unlabeled covering).
Graphs with exactly two automorphisms are A330297 (labeled covering), A330344 (unlabeled), A330345 (labeled), A330346 (unlabeled covering), A241454 (unlabeled connected).
Cf. A006125, A016031, A124059, A143543, A330098, A330224, A330226, A330227, A330230, A330231, A330236.

Programs

  • Mathematica
    graprms[m_]:=Union[Table[Sort[Sort/@(m/.Rule@@@Table[{p[[i]],i},{i,Length[p]}])],{p,Permutations[Union@@m]}]];
Table[Length[Select[Subsets[Subsets[Range[n],{2}]],Length[graprms[#]]==n!&]],{n,5}] (* brute force, not for computation *)

Formula

a(n) = n! * A003400(n).
Showing 1-4 of 4 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.