August 1st, 2010, 05:33 PM  #1 
Member Joined: Feb 2009 Posts: 76 Thanks: 0  Graph theory
Let G be a graph (or multigraph). Determine the number of edges in V for the following situations. a) G is regular (that is each vertex has the same degree) with 15 edges. Determine all the possibilities. hmmm...I was able to construct a graph for this. However, the question asks for 'all the possibilities'. Is there a theorem or formula (or trick) to determine it without having to draw them out U_U. I've seen formulas and theorems in the book but they are about finding the number of edges/vertices or whether the graph is a euler circuit/path by the number of degrees. I can't seem to find one that helps you determine the number of possibilities or how many number of path ways to get from a vertex to another vertex. It seems that I have to do this manually... Id thought Id ask just in case there is one. Thanks in advance 
August 1st, 2010, 08:12 PM  #2 
Member Joined: Feb 2009 Posts: 76 Thanks: 0  Re: Graph theory
Hmm i think I found one that may be useful... It's called the Dijkstra's algorithm. 

Tags 
graph, theory 
Thread Tools  
Display Modes  

Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
A graph problem in graph theory!  lubna_mira  Applied Math  0  January 12th, 2014 02:52 PM 
Graph theory: Linking graph characteristics and minimal cut  avnerg  Applied Math  0  September 18th, 2013 07:03 AM 
Graph theory and number theory  proglote  Number Theory  3  October 30th, 2011 05:20 PM 
graph theory  social networks and reverting the graph  johnyjj2  Applied Math  0  December 28th, 2010 03:49 PM 
Graph theory  4 stroke graph  kec11494  Applied Math  0  December 14th, 2010 07:01 PM 