All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info
Home > Logic
Logic problems. The solution to these problems does not usually require a lot of math, but will take some thinking until you find the right approach.
Sub-Categories (All Problem Categories)
> Liars and Knights> Weights and Scales
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, 0 Comments) Submitted on 2018-06-02 by Math Man   
Page 2 of 41   << prev next >>    
Difficulty: 3 of 5One more line |
Posted on 2017-05-10 by Ady TZIDON (Solution Posted, 4 Comments)
Difficulty: 2 of 5The Dot-town Suicides |
Posted on 2017-04-20 by Ady TZIDON (No Solution Yet, 1 Comments)
Difficulty: 3 of 5Names in Boxes | Rating: 3.75
Posted on 2017-04-09 by Ady TZIDON (No Solution Yet, 10 Comments)
Difficulty: 4 of 5Murder in the Castle | Rating: 4.00
Posted on 2017-03-30 by ollie (No Solution Yet, 4 Comments)
Difficulty: 2 of 5Leave no stone unturned | Rating: 4.00
Posted on 2017-03-19 by Ady TZIDON (Solution Posted, 5 Comments)
Difficulty: 2 of 5An easy whodunit | Rating: 3.50
Posted on 2017-03-08 by Ady TZIDON (Solution Posted, 8 Comments)
Difficulty: 3 of 5Off and On | Rating: 3.00
Posted on 2017-01-29 by Charlie (Solution Posted, 1 Comments)
Difficulty: 1 of 5Beginning of the Month | Rating: 5.00
Posted on 2017-01-09 by Charlie (Solution Posted, 2 Comments)
Difficulty: 3 of 5A's, B's, C's and D's | Rating: 3.00
Posted on 2016-12-30 by Charlie (Solution Posted, 1 Comments)
Difficulty: 3 of 5Who discovered the secret? |
Posted on 2016-12-27 by ollie (No Solution Yet, 4 Comments)
Difficulty: 3 of 5Traveling with Luggage | Rating: 3.00
Posted on 2016-12-15 by Brian Smith (No Solution Yet, 2 Comments)
Difficulty: 3 of 5Your conclusion requested | Rating: 3.67
Posted on 2016-11-03 by Ady TZIDON (No Solution Yet, 9 Comments)
Difficulty: 3 of 5Why not marry? |
Posted on 2016-10-19 by Ady TZIDON (Solution Posted, 6 Comments)
Difficulty: 3 of 5Mismatch Muse |
Posted on 2016-10-18 by K Sengupta (No Solution Yet, 1 Comments)
Difficulty: 3 of 5Bridge Cross Baffle |
Posted on 2016-10-10 by K Sengupta (No Solution Yet, 3 Comments)
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 (1)
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