All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > Logic
The Petersen graph (Posted on 2018-06-02) Difficulty: 3 of 5
A graph is a set of points called vertices connected by lines called edges. Here is a graph called the Petersen graph.
         0         
        /|\        
       / | \       
      /  |  \      
     /   |   \     
    /    |    \    
   /     5     \   
  /     / \     \  
 /     /   \     \ 
1---6-+-----+-9---4
|    \|     |/    |
|     X     X     |
|     |\   /|     |
|     | \ / |     |
|     |  X  |     |
|     | / \ |     |
|     |/   \|     |
|     7     8     |
|    /       \    |
|   /         \   |
|  /           \  |
| /             \ |
|/               \|
2-----------------3
An automorphism of a graph G is a function f:G→G such that f(xy)=f(x)f(y) for all x, y∈G. A vertex-transitive graph is a graph G such that there is an automorphism between any two vertices of G. An edge-transitive graph is a graph G such that there is an automorphism between any two edges of G.

1. Prove that the Petersen graph is vertex-transitive.
2. Prove that the Petersen graph is edge-transitive.

No Solution Yet Submitted by Math Man    
No Rating

Comments: ( You must be logged in to post comments.)
  Subject Author Date
There are no comments yet.
Please log in:
Login:
Password:
Remember me:
Sign up! | Forgot password


Search:
Search body:
Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (3)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:
Copyright © 2002 - 2018 by Animus Pactum Consulting. All rights reserved. Privacy Information