Discrete Math Graph Theory

It's a word doc it opens in the browser there is nothing to download. There is no possible way a word doc (.docx) can hurt a computer.

Problem 3
Let T1 = (V1, E1), T2 = (V2, E2) be two trees where |E1|= 17 and |V2| = 2|V1|. Determine |V1|, |V2|,
and |E2|. All numbers here are subscripts I just do not know how to do those in forums.
 
Last edited:
pka said:
I would be happy to try to help you, but I will not download and open a file.
Click to expand...

Thanks

Problem 3
Let T1 = (V1, E1), T2 = (V2, E2) be two trees where |E1|= 17 and |V2| = 2|V1|. Determine |V1|, |V2|,
and |E2|. All numbers here are subscripts I just do not know how to do those in forums.
 
californiarepoman said:
It's a word doc it opens in the browser there is nothing to download. There is no possible way a word doc (.docx) can hurt a computer.
Click to expand...

When I first open your link, I was given only two options to download the file. It is completely foolish to think that a Word file cannot contain MalWare.

Given a graph \(\displaystyle \mathfrak{G}\) on \(\displaystyle n\) vertices union its complement \(\displaystyle \overline{\mathfrak{G}}\) is a complete graph \(\displaystyle \mathfrak{K}_n\)

The graph \(\displaystyle \mathfrak{K}_n\) contains \(\displaystyle \binom{n}{2}\) edges. So if \(\displaystyle \mathfrak{G}\) is isomorphic to its complement they must have the same of edges.
 
You must log in or register to reply here.
Top