My Math Forum  

Go Back   My Math Forum > College Math Forum > Applied Math

Applied Math Applied Math Forum

LinkBack Thread Tools Display Modes
January 12th, 2014, 01:52 PM   #1
Joined: Jan 2014

Posts: 2
Thanks: 0

A graph problem in graph theory!

Please could anyone help me with the question.

Let G(E,V) be a graph with 32 edges. Suppose all the nodes have the same degree, let us call it d. What is the maximum size for this common degree d if the graph is connected?
(Hint: In any graph, the sum of the degrees of the nodes = twice the number of edges . Since all nodes have the same degree d, the sum of the degrees = nd = 32*2=64, where n = the number of nodes V. Now try values of d consistent with this. Do they all make sense, keeping in mind that nd = 64 ?)
lubna_mira is offline  

  My Math Forum > College Math Forum > Applied Math

graph, problem, theory

Thread Tools
Display Modes

Similar Threads
Thread Thread Starter Forum Replies Last Post
Graph theory: Linking graph characteristics and minimal cut avnerg Applied Math 0 September 18th, 2013 06:03 AM
Graph Theory Problem hicheminfo Applied Math 0 September 16th, 2012 10:22 AM
graph theory problem rayukpant Computer Science 0 August 8th, 2011 06:50 PM
graph theory - social networks and reverting the graph johnyjj2 Applied Math 0 December 28th, 2010 02:49 PM
Graph theory - 4 stroke graph kec11494 Applied Math 0 December 14th, 2010 06:01 PM

Copyright © 2019 My Math Forum. All rights reserved.