# 5.1 Vizing's conjecture and related graph properties

 Page 1 / 4
Vizing's Conjecture is a lower bound for the domination number of the Cartesian Product of two graphs in terms of the domination number of the separate graphs. This module addresses observations about certain graph properties that can be assumed for Vizing's Conjecture and a related conjecture on independent domination numbers.

## Graph

A graph is a set $G\left(V,E\right)$ 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 $\left({v}_{1},{v}_{2}\right)$ are in $E$ . Graphs are a common model for networks.

## Complete graph

A graph G on $n$ vertices is a complete graph if for each pair ${v}_{1},{v}_{2}\in V⇒\left({v}_{1},{v}_{2}\right)\in E$ . Call ${K}_{n}$ the complete graph on $n$ vertices.

## Cartesian product graph

Given graphs $G$ and $H$ the Cartesian Product Graph is defined to be $G\square H$ with

$\begin{array}{ccc}\hfill V\left(G\square H\right)& =& \left\{\left(v,w\right):v\in G,w\in H\right\}\hfill \\ \hfill E\left(G\square H\right)& =& \left\{\left(\left({v}_{1},{w}_{1}\right),\left({v}_{2},{w}_{2}\right)\right):{v}_{1}={v}_{2}\phantom{\rule{4.pt}{0ex}}\text{and}\phantom{\rule{4.pt}{0ex}}\left({w}_{1},{w}_{2}\right)\in E\left(H\right)\hfill \\ & & \phantom{\rule{4.pt}{0ex}}\text{or}\phantom{\rule{4.pt}{0ex}}{w}_{1}={w}_{2}\phantom{\rule{4.pt}{0ex}}\text{and}\phantom{\rule{4.pt}{0ex}}\left({v}_{1},{v}_{2}\right)\in E\left(G\right)\right\}\hfill \end{array}$

## Neighbors

Given a graph $G\left(V,E\right)$ and a set $S\subseteq V$ then we define the neighbors of $S$ to be the set

$N\left(S\right)=\left\{v:v\in V\phantom{\rule{4.pt}{0ex}}\text{and}\phantom{\rule{4.pt}{0ex}}\left(v,s\right)\in E\phantom{\rule{4.pt}{0ex}}\text{for}\phantom{\rule{4.pt}{0ex}}\text{some}\phantom{\rule{4.pt}{0ex}}s\in S\right\}\setminus S$

and similarly the closed neighborhood is the set

$N\left[S\right]=\left\{v:v\in V\phantom{\rule{4.pt}{0ex}}\text{and}\phantom{\rule{4.pt}{0ex}}\left(v,s\right)\in E\phantom{\rule{4.pt}{0ex}}\text{for}\phantom{\rule{4.pt}{0ex}}\text{some}\phantom{\rule{4.pt}{0ex}}s\in S\right\}\cup S$

## Dominating set

Given a graph $G\left(V,E\right)$ , a set $D\subseteq V$ is a dominating set if $N\left[D\right]=V$ .

## Domination number

Given a graph $G\left(V,E\right)$ , the domination number of $G$ is

$\gamma \left(G\right)=min\left\{|D|:N\left[D\right]=V\right\}$

## K-critical graph

A graph $G\left(V,E\right)$ , 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 \left(G+uv\right) .

## Independent set

Given a graph $G\left(V,E\right)$ , a set $I\subseteq V$ is independent if for all $v,w\in I⇒\left(v,w\right)\notin E$ . An independent set is maximal if it is not a subset of any other independent set.

## Independence number

Given a graph $G\left(V,E\right)$ , the independence number denoted $i\left(G\right)$ is defined by

$i\left(G\right)=min\left(\left\{|I|:I\phantom{\rule{4.pt}{0ex}}\text{is}\phantom{\rule{4.pt}{0ex}}\text{a}\phantom{\rule{4.pt}{0ex}}\text{maximal}\phantom{\rule{4.pt}{0ex}}\text{independent}\phantom{\rule{4.pt}{0ex}}\text{set}\right\}\right)$

## Domination theory

Domination Theory is an emerging field in Graph Theory addressing how to find dominating sets for certain graphs and important models in the theory.

## Applications

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]

a perfect square v²+2v+_
kkk nice
algebra 2 Inequalities:If equation 2 = 0 it is an open set?
or infinite solutions?
Kim
y=10×
if |A| not equal to 0 and order of A is n prove that adj (adj A = |A|
rolling four fair dice and getting an even number an all four dice
Kristine 2*2*2=8
Differences Between Laspeyres and Paasche Indices
No. 7x -4y is simplified from 4x + (3y + 3x) -7y
is it 3×y ?
J, combine like terms 7x-4y
im not good at math so would this help me
how did I we'll learn this
f(x)= 2|x+5| find f(-6)
f(n)= 2n + 1
Need to simplify the expresin. 3/7 (x+y)-1/7 (x-1)=
. After 3 months on a diet, Lisa had lost 12% of her original weight. She lost 21 pounds. What was Lisa's original weight?
preparation of nanomaterial
Yes, Nanotechnology has a very fast field of applications and their is always something new to do with it...
can nanotechnology change the direction of the face of the world
At high concentrations (>0.01 M), the relation between absorptivity coefficient and absorbance is no longer linear. This is due to the electrostatic interactions between the quantum dots in close proximity. If the concentration of the solution is high, another effect that is seen is the scattering of light from the large number of quantum dots. This assumption only works at low concentrations of the analyte. Presence of stray light.
the Beer law works very well for dilute solutions but fails for very high concentrations. why?
how did you get the value of 2000N.What calculations are needed to arrive at it
Got questions? Join the online conversation and get instant answers!