Discrete Math: Graph Theory #54. If A is a simple graph with 15 edges, and Ā has 13 edges, how many vertices does A have? Can anyone give me the answer and how to arrive at it? Thanks a bunch, Yvonne
Follow Math Help Forum on Facebook and Google+
Originally Posted by yvonnehr Discrete Math: Graph Theory #54. If A is a simple graph with 15 edges, and Ā has 13 edges, how many vertices does A have? Can anyone give me the answer and how to arrive at it? Thanks a bunch, Yvonne do you know this statement? Let be the complementary graph of . Then
Originally Posted by kalagota do you know this statement? Let be the complementary graph of . Then I don't believe I have seen this. Is this related or some rendition of the Handshaking Theorem? -Ivy
i dont think so.. we discussed this as a remark in graph operations..
Originally Posted by kalagota do you know this statement? Let be the complementary graph of . Then Tell me I am reading this right. The sum of the cardinality of (edges) G and G-compliment equals to the cardinality of (vertices) G. Sorry if I am not getting this correctly. It is very late for me. :-) You know how it goes.
Originally Posted by yvonnehr Tell me I am reading this right. The sum of the cardinality of (edges) G and G-compliment equals to the cardinality of (vertices) G. Sorry if I am not getting this correctly. It is very late for me. :-) You know how it goes. ... cardinality of (vertices) G taken 2.. EDIT: that is the usual combination formula..
Last edited by kalagota; June 23rd 2008 at 12:37 AM.
View Tag Cloud