Results 1 to 3 of 3

Math Help - Graph theory

  1. #1
    Newbie
    Joined
    Dec 2010
    Posts
    15

    Graph theory

    I would like to help me with this homework:

    Let be the adjacency matrix of and the adjacency matrix of . Asume that every vertex of is distinguished.
    How many sub-matrices of ,if we apply some reorder so much to their(submatrices) rows as to their columns, are equal to ?

    Thank you in advance
    Follow Math Help Forum on Facebook and Google+

  2. #2
    Newbie
    Joined
    Dec 2010
    Posts
    15
    The quastion is about to find how many subgrapgs of K8 are isomorphic to K3,3 if the vertices are distinguished
    Follow Math Help Forum on Facebook and Google+

  3. #3
    MHF Contributor

    Joined
    Aug 2006
    Posts
    18,966
    Thanks
    1785
    Awards
    1
    Quote Originally Posted by nick1978 View Post
    The quastion is about to find how many subgraphs of K8 are isomorphic to K3,3 if the vertices are distinguished
    Well I would have never gotten that meaning from the OP.
    There are 280 ways to divide a group of eight individuals into two groups of three and one group of two. The two groups of three could be used as the bipartite sets in \math{K}_{3,3}.

    I hope that is in fact what the OP means.
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. Graph theory, bipartite Graph
    Posted in the Math Topics Forum
    Replies: 2
    Last Post: March 10th 2012, 06:47 AM
  2. Graph Theory / Chromatic Number of a Complete Graph
    Posted in the Discrete Math Forum
    Replies: 1
    Last Post: November 15th 2011, 10:59 AM
  3. (Graph Theory)Prove that graph X is a tree.
    Posted in the Discrete Math Forum
    Replies: 1
    Last Post: August 1st 2011, 04:30 AM
  4. Replies: 0
    Last Post: September 25th 2010, 06:59 AM
  5. Graph Theory - Size of a Line Graph
    Posted in the Discrete Math Forum
    Replies: 1
    Last Post: July 26th 2010, 12:15 AM

Search Tags


/mathhelpforum @mathhelpforum