answersLogoWhite

0

Well of n vertices you can get the comlete graphs of kn-1

I just did a similar problem where you find the k3 graphs in kn I found the answer to be n choose 3 becaause i simply neeeded to choose 3 different vertices so the number of k4 grpahs would be n choose 4 and so on the number of edges or complete k2 graphs is n choose 2 I know i didnt answer your question but i feel as if this might help u get it done

User Avatar

Wiki User

11y ago

Still curious? Ask our experts.

Chat with our AI personalities

MaxineMaxine
I respect you enough to keep it real.
Chat with Maxine
BlakeBlake
As your older brother, I've been where you are—maybe not exactly, but close enough.
Chat with Blake
ViviVivi
Your ride-or-die bestie who's seen you through every high and low.
Chat with Vivi

Add your answer:

Earn +20 pts
Q: How many of the subgraphs of kn are complete graphs?
Write your answer...
Submit
Still have questions?
magnify glass
imp