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 1 of 41   next >>    
Difficulty: 2 of 5Five International Delegates |
Posted on 2018-04-18 by Charlie (Solution Posted, 1 Comments)
Difficulty: 2 of 5Past and present |
Posted on 2018-03-05 by Ady TZIDON (Solution Posted, 3 Comments)
Difficulty: 3 of 5A special phenomenon | Rating: 5.00
Posted on 2018-01-05 by Ady TZIDON (No Solution Yet, 3 Comments)
Difficulty: 2 of 5Enigma |
Posted on 2017-12-11 by Ady TZIDON (No Solution Yet, 2 Comments)
Difficulty: 2 of 5Letters in a Box |
Posted on 2017-10-30 by Charlie (Solution Posted, 2 Comments)
Difficulty: 3 of 5An unsolved double murder |
Posted on 2017-09-08 by ollie (No Solution Yet, 0 Comments)
Difficulty: 2 of 5smallest large = largest small | Rating: 3.00
Posted on 2017-08-22 by Jer (No Solution Yet, 3 Comments)
Difficulty: 2 of 5At the bridge club | Rating: 5.00
Posted on 2017-08-15 by Ady TZIDON (No Solution Yet, 2 Comments)
Difficulty: 3 of 5Centenarians | Rating: 3.00
Posted on 2017-06-29 by Charlie (Solution Posted, 1 Comments)
Difficulty: 3 of 5Combinatory logic |
Posted on 2017-06-24 by Math Man (No Solution Yet, 0 Comments)
Difficulty: 3 of 5 Empty the bucket | Rating: 4.50
Posted on 2017-05-29 by Ady TZIDON (Solution Posted, 12 Comments)
Difficulty: 2 of 5Two sentences about Lady Chatterley | Rating: 4.00
Posted on 2017-05-18 by ollie (Solution Posted, 4 Comments)
Difficulty: 3 of 5Unreliable Witnesses | Rating: 3.67
Posted on 2017-05-17 by Charlie (Solution Posted, 4 Comments)
Difficulty: 3 of 5Dirichlet sends his regards | Rating: 3.00
Posted on 2017-05-12 by Ady TZIDON (No Solution Yet, 4 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 (7)
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