My Math Forum  

Go Back   My Math Forum > High School Math Forum > Geometry

Geometry Geometry Math Forum


Reply
 
LinkBack Thread Tools Display Modes
September 27th, 2018, 07: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 .
coolio is offline  
 
Reply

  My Math Forum > High School Math Forum > Geometry

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 06:16 PM
A Question Regarding Connected and Quasi-Components Hooman Real Analysis 0 February 7th, 2013 04:27 PM
question regarding connected planar graph discretemath Applied Math 3 October 25th, 2012 05:03 AM
How to prove a simple graph is 2-connected? cxc001 Applied Math 1 September 17th, 2010 07:49 PM
How to prove a simple graph is 2-connected? cxc001 Number Theory 1 December 31st, 1969 04:00 PM





Copyright © 2018 My Math Forum. All rights reserved.