Complete Graphs 2

Level pending

Each of the edges of a complete graph with 10 vertices is coloured either blue or red .There are x vertices such that all the edges connecting them are of the same colour.

Find x

Details - In the mathematical field of graph theory, a complete graph is a simple undirected graph in which every pair of distinct vertices is connected by a unique edge. A complete digraph is a directed graph in which every pair of distinct vertices is connected by a pair of unique edges (one in each direction) (source - Wikipedia)for more go to Wikipedia site

×

Problem Loading...

Note Loading...

Set Loading...