Results 1 to 1 of 1

Thread: Pairwise non-isomorphic formality

  1. #1
    Nov 2009

    Pairwise non-isomorphic formality

    Hey everyone, I am trying to solve a problem which is:

    Find the number of pairwise non-isomorphic graphs with a certain property (the property is not important).

    My problem is that I have shown that all graphs with this given property are isomorphic, but now I am unsure as to whether this means there are NO pairwise non-isomorphic graphs of this type, since any 2 graphs you choose will be isomorphic (so the answer is 0), or whether since they are all isomorphic, we have a single isomorphism class and the answer is 1 (since we consider all graphs to be 'the same')

    It's an annoying formality, but I can't get my head around it.

    Any help on the matter would be much appreciated. Thanks.
    Last edited by Symphony6; Nov 29th 2009 at 08:14 AM.
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. pairwise relatively prime
    Posted in the Number Theory Forum
    Replies: 3
    Last Post: Jun 10th 2010, 08:58 AM
  2. Pairwise non-isomorphic regular graphs!
    Posted in the Discrete Math Forum
    Replies: 0
    Last Post: Nov 29th 2009, 11:22 AM
  3. Pairwise Independence vs Idependence help
    Posted in the Advanced Statistics Forum
    Replies: 1
    Last Post: Sep 15th 2009, 02:50 PM
  4. pairwise prime
    Posted in the Number Theory Forum
    Replies: 5
    Last Post: Sep 6th 2008, 05:21 PM
  5. pairwise relatively prime integers
    Posted in the Number Theory Forum
    Replies: 4
    Last Post: Jul 17th 2006, 10:10 AM

Search Tags

/mathhelpforum @mathhelpforum