1. Limited time only! Sign up for a free 30min personal tutor trial with Chegg Tutors
    Dismiss Notice
Dismiss Notice
Join Physics Forums Today!
The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

Counting edge numbers in bipartite graphs

  1. Oct 15, 2014 #1
    Let L be the level number of a bipartite graph G, and so
    L1 be the first level of n1 vertices,
    L2 be the second level of n2 vertices,
    ...
    Lk be the kth level of nk vertices.
    Then a bipartite graph G12 is created by a combination of L1 and L2, G23 is of L2 and L3,...,Gij is of Li and Lj.

    The number of edges in a bipartite graph is [itex]m[/itex]x[itex]n[/itex]. And the total number of the above network of bipartite graphs is [tex]\sum=n_1n_2+n_1n_3+...+n_1n_k+n_2n_3+....+n_2n_k+...+n_{k-1}n_k[/tex]
    • Is my sum above correct ?
    • Are there any research publication concerning this bipartite graph node combination in networking optimization, genetic network, numerical research or graph theories that you know about ?
    All the definitions are self-made, I have not been working with graphs for years, many basics are thus forgotten. Thank you. :D
     
  2. jcsd
  3. Oct 21, 2014 #2
    Thanks for the post! Sorry you aren't generating responses at the moment. Do you have any further information, come to any new conclusions or is it possible to reword the post?
     
Know someone interested in this topic? Share this thread via Reddit, Google+, Twitter, or Facebook




Similar Discussions: Counting edge numbers in bipartite graphs
Loading...