Vipul at 21:18, 29 May 2012

2012-05-29T21:18:28Z

← Older revision		Revision as of 21:18, 29 May 2012
Line 18:		Line 18:

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

			==Arithmetic functions==

			===Size measures===

			{\| class="sortable" border="1"
			! Function !! Value !! Explanation
			\|-
			\| {{arithmetic function value\|size of vertex set\|4}} \|\| As <math>K_{m,n}, m = 1, n = 3</math>: <math>m + n = 1 + 3 = 4</math>
			\|-
			\| {{arithmetic function value\|size of edge set\|3}} \|\| As <math>K_{m,n}, m = 1, n = 3</math>: <math>mn = (1)(3) = 3</math>
			\|}

Vipul: Created page with "{{particular undirected graph}} ==Definition== This graph is defined as the complete bipartite graph $K_{1,3}$ , i.e., it is a graph with 4 vertices and 3 edge..."

2012-05-29T21:11:15Z

Created page with "{{particular undirected graph}} ==Definition== This graph is defined as the complete bipartite graph <math>K_{1,3}</math>, i.e., it is a graph with 4 vertices and 3 edge..."

New page

{{particular undirected graph}}

==Definition==

This graph is defined as the [[complete bipartite graph]] <math>K_{1,3}</math>, i.e., it is a graph with 4 vertices and 3 edges, all sharing a common vertex, with the other vertex free to vary.

==Explicit descriptions==

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

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

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

===Adjacency matrix===

With the above ordering of vertices, the adjacency matrix is:

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

Complete bipartite graph:K1,3 - Revision history

Vipul at 21:18, 29 May 2012

Vipul: Created page with "{{particular undirected graph}} ==Definition== This graph is defined as the complete bipartite graph K_{1,3}, i.e., it is a graph with 4 vertices and 3 edge..."

Vipul: Created page with "{{particular undirected graph}} ==Definition== This graph is defined as the complete bipartite graph $K_{1,3}$ , i.e., it is a graph with 4 vertices and 3 edge..."