|September 18th, 2013, 06:03 AM||#1|
Joined: Sep 2013
Graph theory: Linking graph characteristics and minimal cut
I'm currently working on a research involving Graph theory.
More specifically, I would like to make an analytical or theoretic connection between different characteristics of the graph (e.g. size, node degree distribution, number of nodes with degree 1, etc.) to its minimal cut. The graph is also characterized by a source and a sink for flow purposes. By minimal I mean the number of edges or sum of capacities.
Relevant connections might be on the distribution of number of paths from S to T in the minimal cut, distribution of cut-sizes, etc.
I'd appreciate if someone can suggest a lead, paper or a good approach to tackle this both theoretically and analytically.
Thank you in advance for the effort,
|characteristics, cut, graph, linking, minimal, theory|
|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 - 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|
|graph theory||huweizhi||Applied Math||7||January 27th, 2010 04:18 PM|
|Graph Theory||tuzzi-i||Applied Math||2||January 19th, 2007 12:59 AM|