Jump to content

Zero-symmetric graph

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by (don't talk secrets) (talk | contribs) at 12:06, 7 January 2015 (new stub). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

In the mathematical field of graph theory, a zero-symmetric graph is a vertex-transitive cubic graph whose edges are partitioned into three orbits by its automorphism group.[1]

See also

References

  1. ^ Coxeter, H. S. M.; Frucht, R.; and Powers, D. L. Zero-Symmetric Graphs: Trivalent Graphical Regular Representations of Groups. New York: Academic Press, 1981. Amazon link
Stub icon

This mathematics-related article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Zero-symmetric_graph&oldid=641401286"