PlanetMath (more info)
 Math for the people, by the people. Sponsor PlanetMath
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 (237)
Orphanage
Unclass'd
Unproven (550)
Corrections (54)
Classification

talkback
Polls
Forums
Feedback
Bug Reports

downloads
Snapshots
PM Book

information
News
Docs
Wiki
ChangeLog
TODO List
Copyright
About
Revision difference : edge covering
Version current Version 4
Let $G$ be a graph. An \emph{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$. Let $G$ be a graph. An \emph{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 \PMlinkescapeword{entire} vertex set is a trivial edge covering. Generally, we are more interested in \emph{minimal coverings}. A minimal edge covering is simply an edge covering of the least possible \PMlinkescapeword{size}. For any graph, the \PMlinkescapeword{entire} vertex set is a trivial edge covering. Generally, we are more interested in \emph{minimal coverings}. A minimal edge covering is simply an edge covering of the least possible \PMlinkescapeword{size}.