Neumann polynomial
From formulasearchengine
Revision as of 07:03, 18 July 2012 by
en>FrescoBot
(Bot:
link syntax/spacing
and minor changes)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation
Jump to search
Graph families defined by their automorphisms
distance-transitive
→
distance-regular
←
strongly regular
↓
symmetric (arc-transitive)
←
t
-transitive,
t
≥ 2
↓
(if connected)
vertex- and edge-transitive
→
edge-transitive and regular
→
edge-transitive
↓
↓
↓
vertex-transitive
→
regular
→
(if bipartite)
biregular
↑
Cayley graph
skew-symmetric
asymmetric
Navigation menu
Personal tools
Log in
Namespaces
Page
Discussion
English
Views
Read
View source
View history
More
Search
Navigation
Main page
Recent changes
Random page
Help about MediaWiki
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
Cite this page