Four fixed vertices are given, call them a,b,c,d. Explain your
answers.
(a) How many simple (no loops, no multiple edges) undirected graphs are
there with this vertex set?
(b) How many simple directed graphs?
Tags for this Thread
+ Reply to Thread
Results 1 to 1 of 1
-
11-22-2010, 04:41 AM #1
Probation Member
Status- Offline
Join Date- May 2009
Posts- 34
Downloads- 0
Uploads- 0
In Graph Theory, how many simple undirected graphs can be made with a set of 4 elements?
ReplyThread Information
Users Browsing this Thread
There are currently 1 users browsing this thread. (0 members and 1 guests)
Similar Threads
-
Sketch the region bounded by the graphs and set up and evaluate the integral
By Trevor in forum Discuss Painting and SculptureReplies: 0Last Post: 02-12-2011, 05:33 AM -
can some one send me the solution manual of the book elements of the theory of
By anuradha in forum Discuss Books and AuthorsReplies: 0Last Post: 11-27-2010, 04:43 AM -
Elements of this graph relation?
By Marzi in forum Discuss EnvironmentReplies: 0Last Post: 04-26-2010, 07:00 AM -
How should I set up a simple set of Accounts for a small import/export business in
By Simon in forum Discuss BusinessReplies: 0Last Post: 04-16-2010, 06:18 AM -
is there a simple way to create a 3d scatter graph?
By jim_lheureux in forum Ælternate Reality - The PhotoChop ShopReplies: 0Last Post: 06-12-2008, 09:58 PM
Bookmarks