Jump to content

Edge and vertex spaces

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by MathMartin (talk | contribs) at 19:23, 17 March 2005 (Initial stub). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) โ† Previous revision | Latest revision (diff) | Newer revision โ†’ (diff)

In the mathematical discipline of graph theory the edge space for a finite undirected graph is vector space structure on the edge set of the graph, making it possible to use linear algebra for studying the graph.

Definition

Given a finite undirected graph with edges, the edge space is a -dimensional vector space over . The elements of the vector space are linear combination of edges of with addition defined as the symmetric difference.

Properties

The Incidence matrix for a graph defines a linear transformation

between the edge space and the vertex space of .

See also