TOPICS
Search

Septic Graph


SepticGraphs

A septic graph is a regular graph of degree seven. The numbers of (not necessarily connected) simple septic graphs on n=8, 10, 12, ... vertices are 1, 5, 1547, 21609301, 733351105935, ... (OEIS A165628).

The numbers of connected septic graphs on n=8, 10, 12, ... vertices are 1, 5, 1547, 21609301, 733351105934, ... (OEIS AA014377), with the sole disconnected 16-vertex graph being 2K_8.

Examples of septic graphs are illustrated above and summarized in the following table.


See also

Regular Graph

Explore with Wolfram|Alpha

References

Meringer, M. "Connected Regular Graphs." http://www.mathe2.uni-bayreuth.de/markus/reggraphs.html#CRG.Sloane, N. J. A. Sequences A014377 and AA165628 in "The On-Line Encyclopedia of Integer Sequences."

Referenced on Wolfram|Alpha

Septic Graph

Cite this as:

Weisstein, Eric W. "Septic Graph." From MathWorld--A Wolfram Web Resource. https://mathworld.wolfram.com/SepticGraph.html

Subject classifications