
Geometry Geometry Math Forum 
 LinkBack  Thread Tools  Display Modes 
September 27th, 2018, 06:29 PM  #1 
Newbie Joined: Sep 2018 From: United States Posts: 2 Thanks: 0  Let G be a simple graph with c connected components
I need help solving the following problem: Let G be a simple graph with c connected components, which have a1, . . . , ak vertices, respectively. Determine the number of ways to add c − 1 edges to G to form a connected graph, in terms of the numbers ai . 

Tags 
components, connected, geometry, graph, simple 
Thread Tools  
Display Modes  

Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Moving Connected Graph  router  Topology  0  December 9th, 2014 05:16 PM 
A Question Regarding Connected and QuasiComponents  Hooman  Real Analysis  0  February 7th, 2013 03:27 PM 
question regarding connected planar graph  discretemath  Applied Math  3  October 25th, 2012 04:03 AM 
How to prove a simple graph is 2connected?  cxc001  Applied Math  1  September 17th, 2010 06:49 PM 
How to prove a simple graph is 2connected?  cxc001  Number Theory  1  December 31st, 1969 04:00 PM 