Vipul at 21:23, 29 May 2012

2012-05-29T21:23:09Z

← Older revision		Revision as of 21:23, 29 May 2012
Line 3:		Line 3:
	==Definition==		==Definition==

	This graph, denoted <math>K_5</math>, is defined as the [[complete graph]] on a set of size 5.		This graph, denoted <math>K_5</math>, is defined as the [[complete graph]] on a vertex set of size 5.

			==Explicit descriptions==

			===Descriptions of vertex set and edge set===

			Vertex set: <math>\{ 1,2,3,4,5 \}</math>

			Edge set: <math>\{ \{ 1,2 \}, \{ 1,3 \}, \{ 1,4 \}, \{ 1, 5 \}, \{ 2,3 \}, \{ 2,4 \}, \{ 2,5 \}, \{ 3,4 \}, \{ 3, 5 \}, \{ 4, 5 \} \}</math>

			===Adjacency matrix===

			The adjacency matrix is:

			<math>\begin{pmatrix} 0 & 1 & 1 & 1 & 1 \\ 1 & 0 & 1 & 1 & 1 \\ 1 & 1 & 0 & 1 & 1 \\ 1 & 1 & 1 & 0 & 1 \\1 & 1 & 1 & 1 & 0 \\\end{pmatrix}</math>

			The matrix is uniquely defined (note that it centralizes all permutations).

Vipul: Created page with "{{particular undirected graph}} ==Definition== This graph, denoted $K_5$ , is defined as the complete graph on a set of size 5."

2012-05-28T04:12:09Z

Created page with "{{particular undirected graph}} ==Definition== This graph, denoted <math>K_5</math>, is defined as the complete graph on a set of size 5."

New page

{{particular undirected graph}}

==Definition==

This graph, denoted <math>K_5</math>, is defined as the [[complete graph]] on a set of size 5.

Complete graph:K5 - Revision history

Vipul at 21:23, 29 May 2012

Vipul: Created page with "{{particular undirected graph}} ==Definition== This graph, denoted K_5, is defined as the complete graph on a set of size 5."

Vipul: Created page with "{{particular undirected graph}} ==Definition== This graph, denoted $K_5$ , is defined as the complete graph on a set of size 5."