<< Chapter < Page | Chapter >> Page > |
A graph is a set $G(V,E)$ with $V$ a set of vertices and $E$ a set of edges or vertex pairs. Two vertices ${v}_{1},{v}_{2}\in V$ are adjacent if the vertex pair $({v}_{1},{v}_{2})$ are in $E$ . Graphs are a common model for networks.
A graph G on $n$ vertices is a complete graph if for each pair ${v}_{1},{v}_{2}\in V\Rightarrow ({v}_{1},{v}_{2})\in E$ . Call ${K}_{n}$ the complete graph on $n$ vertices.
Given graphs $G$ and $H$ the Cartesian Product Graph is defined to be $G\square H$ with
Given a graph $G(V,E)$ and a set $S\subseteq V$ then we define the neighbors of $S$ to be the set
and similarly the closed neighborhood is the set
Given a graph $G(V,E)$ , a set $D\subseteq V$ is a dominating set if $N\left[D\right]=V$ .
Given a graph $G(V,E)$ , the domination number of $G$ is
A graph $G(V,E)$ , is called k-edge-critical (or k-critical , for short) if $\gamma \left(G\right)=k$ , and, $\forall $ $u,v\in V\left(G\right)$ such that $u$ and $v$ are not adjacent, $\gamma (G+uv)<k$ .
Given a graph $G(V,E)$ , a set $I\subseteq V$ is independent if for all $v,w\in I\Rightarrow (v,w)\notin E$ . An independent set is maximal if it is not a subset of any other independent set.
Given a graph $G(V,E)$ , the independence number denoted $i\left(G\right)$ is defined by
Domination Theory is an emerging field in Graph Theory addressing how to find dominating sets for certain graphs and important models in the theory.
Domination Theory is a very interesting subfield of graph theory because it has many real-world applications. Finding a minimum set whose closed neighborhood encompasses a network has obvious implications for minimum-cost ways of altering a network, or cheaply distributing goods throughout a network. For example, dominating set theory can help cell phone companies place a minimum number of towers to insure coverage for all of its clients. Similarly, dominating set theory can be useful for social marketing, in order to succesfully spread news about a product by using a minimal number of advertisements. In a less business-minded view, domination theory can help modeling the squares which are connected by the moves of a chess piece (such as the queen). This can be useful for solving problems like the maximum-placement problem, for an arbitary chess board, or for pieces with different movements. Lastly, domination theory can also have applications in facility location problems, such as finding the minimum distance to travel to one out of a set of locations (such as a police station). [link]
Notification Switch
Would you like to follow the 'The art of the pfug' conversation and receive update notifications?