A Graph is said to be regular of degree if all Local Degrees
are the same number . Then

where is the number of Edges. The connected 3-regular graphs have been determined by G. Brinkman up to 24 Vertices.

**References**

Chartrand, G. *Introductory Graph Theory.* New York: Dover, p. 29, 1985.

© 1996-9

1999-05-25