PlanetMath (more info)
 Math for the people, by the people.
Encyclopedia | Requests | Forums | Docs | Wiki | Random | RSS  
Login
create new user
name:
pass:
forget your password?
Main Menu
sections
Encyclopædia
Papers
Books
Expositions

meta
Requests (200)
Orphanage
Unclass'd
Unproven (490)
Corrections (6)
Classification

talkback
Polls
Forums
Feedback
Bug Reports

downloads
Snapshots
PM Book

information
News
Docs
Wiki
ChangeLog
TODO List
Legalese
About
Owner confidence rating: Low Entry average rating: No information on entry rating
edge covering (Definition)

Let $ G$ be a graph. An edge covering $ C$ on $ G$ is a subset of the vertices of $ G$ such that each edge in $ G$ is incident with at least one vertex in $ C$.

For any graph, the vertex set is a trivial edge covering. Generally, we are more interested in minimal coverings. A minimal edge covering is simply an edge covering of the least possible .



"edge covering" is owned by vampyr.
(view preamble)

View style:

See Also: matching

Also defines:  minimal edge covering
Log in to rate this entry.
(view current ratings)

Cross-references: coverings, minimal, incident, edge, vertices, subset, graph
There is 1 reference to this entry.

This is version 5 of edge covering, born on 2002-05-26, modified 2002-07-06.
Object id is 2940, canonical name is EdgeCovering.
Accessed 3421 times total.

Classification:
AMS MSC: 05C70 (Combinatorics :: Graph theory :: Factorization, matching, covering and packing)
Pending Errata and Addenda
None.
Discussion
Style: Expand: Order:
forum policy

No messages.

Interact
post | correct | update request | add derivation | add example | add (any)