Complete graph:K4: Difference between revisions

Revision as of 03:53, 29 May 2012

This article defines a particular undirected graph, i.e., the definition here determines the graph uniquely up to graph isomorphism.
View a complete list of particular undirected graphs

Definition

This graph is defined as the complete graph on a set of size four.

Arithmetic functions

Size measures

Function	Value	Explanation
size of vertex set	4	As $K_{n},n=4$ : $n=4$
size of edge set	6	As $K_{n},n=4$ : ${\binom {n}{2}}={\binom {4}{2}}=6$

@@ Line 4: / Line 4: @@
 This graph is defined as the [[complete graph]] on a set of size four.
+==Arithmetic functions==
+===Size measures===
+{| class="sortable" border="1"
+! Function!! Value !! Explanation
+|-
+| {{arithmetic function value|size of vertex set|4}} || As <math>K_n, n = 4</math>: <math>n = 4</math>
+|-
+| {{arithmetic function value|size of edge set|6}} || As <math>K_n, n = 4</math>: <math>\binom{n}{2} = \binom{4}{2} = 6</math>
+|}