![]() | This article is rated Start-class on Wikipedia's
content assessment scale. It is of interest to the following WikiProjects: | ||||||||||
|
it would be nice to have an example of a regular graph that is not vertex-transitive, however, I don't know any. Evilbu 20:43, 14 February 2006 (UTC)
Why is the automorphism written as V(G) --> V(G)? This seems as if it is just an automorphism (i.e. bijection) of the underlying vertex sets. It should be G --> G, right? -- -oo- ( talk) 09:14, 17 March 2016 (UTC)
![]() | This article is rated Start-class on Wikipedia's
content assessment scale. It is of interest to the following WikiProjects: | ||||||||||
|
it would be nice to have an example of a regular graph that is not vertex-transitive, however, I don't know any. Evilbu 20:43, 14 February 2006 (UTC)
Why is the automorphism written as V(G) --> V(G)? This seems as if it is just an automorphism (i.e. bijection) of the underlying vertex sets. It should be G --> G, right? -- -oo- ( talk) 09:14, 17 March 2016 (UTC)