# 5.1 Vizing's conjecture and related graph properties  (Page 2/4)

 Page 2 / 4

## Vizing's conjecture

Creating bounds for domination numbers is common practice since calculating a graphs domination number was proven NP-Complete by Garey and Johnson [link] in 1976. Arguably, the biggest open problem in Domination Theory is Vizing's Conjecture. It states that the product of the domination number of any two simple graphs $G$ and $H$ is no larger than the domination number of their cartesian product graph.

$\gamma \left(G\right)\gamma \left(H\right)\le \gamma \left(G\square H\right)$

## Clark and suen's proof

In 2000, Clark and Suen [link] proved that for any simple graphs G and H,

$\gamma \left(G\right)\gamma \left(H\right)\le 2\gamma \left(G\square H\right)$

Their proof finds an upper and lower bound for the number of dominatiors in a Cartesian product, and combines the inqualities to put a bound on $\gamma \left(G\square H\right)$ . The proof is shown here:

Say that D is a dominating set of $G\square H$ . Let $\left\{{u}_{1},...,{u}_{\gamma \left(G\right)}\right\}$ be a dominating set of $G$ . We can create partitions $\left\{{\Pi }_{1},...,{\Pi }_{\gamma \left(G\right)}\right\}$ such that if $u\in {\Pi }_{i}$ , then $u={u}_{i}$ or $u\in N\left({u}_{i}\right)$ . Now we can create a partition of dominators $\left\{{D}_{1},...,{D}_{\gamma \left(G\right)}\right\}$ , where

${D}_{i}=\left({\Pi }_{i}×V\left(H\right)\right)\cap D$

Let

${P}_{i}=\left\{v:\left(u,v\right)\in {D}_{i},u\in {\Pi }_{i}\right\}$

Since ${P}_{i}\cup \left(V\left(H\right)-{N}_{H}\left[{P}_{i}\right]\right)$ is a dominating set of $H$ for any $i$ , the number of vertices in $V\left(H\right)$ not dominated by ${P}_{i}$ satisfies

$|V\left(H\right)-{N}_{H}\left[{P}_{i}\right]|+|{P}_{i}|\ge \gamma \left(H\right)$

For $v\in V\left(H\right)$ , let

${Q}_{v}=D\cap \left(V\left(G\right)×\left\{v\right\}\right)=\left\{\left(u,v\right)\in D:u\in V\left(G\right)\right\}$

Also, let

$C=\left\{\left(i,v\right):{\Pi }_{i}×\left\{v\right\}\subseteq {N}_{G\square H}\left[{Q}_{v}\right]\right\}$

Now, we want to find upper and lower bounds for $|C|$ . Let

${L}_{i}=\left\{\left(i,v\right)\in C:v\in V\left(H\right)\right\}$
${R}_{v}=\left\{\left(i,v\right)\in C:1\le i\le \gamma \left(G\right)\right\}$

We then see that:

$|C|=\sum _{i=1}^{\gamma \left(G\right)}|{L}_{i}|=\sum _{v\in V\left(H\right)}^{}|{R}_{v}|$

Note that if $v\in V\left(H\right)-{N}_{H}\left[{P}_{i}\right]$ , then the vertices in ${\Pi }_{i}×\left\{v\right\}$ must be dominated by vertices in ${Q}_{v}$ , so $\left(i,v\right)\in {L}_{i}$ . This implies that

${L}_{i}\ge |V\left(H\right)-{N}_{H}\left[{P}_{I}\right]|$

So,

$|C|\ge \sum _{i=1}^{\gamma \left(G\right)}|V\left(H\right)-{N}_{H}\left[{P}_{i}\right]|\ge \gamma \left(G\right)\gamma \left(H\right)-\sum _{i=1}^{\gamma \left(G\right)}|{P}_{i}|\ge \gamma \left(G\right)\gamma \left(H\right)-\sum _{i=1}^{\gamma \left(G\right)}|{D}_{i}|$

For each $v\in V\left(H\right),|{R}_{v}|\le |{Q}_{v}|$ . If not, $\left\{u:\left(u,v\right)\in {Q}_{v}\right\}\cup \left\{{u}_{j}:\left(j,v\right)\notin {R}_{v}\right\}$ is a dominating set in G with cardinality

$|{Q}_{v}|+\left(\gamma \left(G\right)-|{R}_{v}|\right)=\gamma \left(G\right)-\left(|{R}_{v}|-|{Q}_{v}|\right)<\gamma \left(G\right)$

$|C|=\sum _{v\in V\left(H\right)|}^{}|{R}_{v}|\le \sum _{v\in V\left(H\right)}^{}|{Q}_{v}|=|D|$

It then follows that $\gamma \left(G\right)\gamma \left(H\right)-|D|\le |C|\le |D|$ , which concludes the theorem. $\square$

## Proofs for specific cases of $\gamma \left(G\right)$

Additionally, the proofs that Vizing's conjecture holds for $\gamma \left(G\right)=1$ and $\gamma \left(G\right)=2$ are trivial. In 2004, Sun [link] proved that Vizing's conjecture holds for $\gamma \left(G\right)=3$ . We will briefly step through the main ideas behind the proof here.

The idea behind the proof is that we can count three disjoint sets of dominators in $G\square H$ , such that each of these sets has cardinality of at least $\gamma \left(H\right)$ . Since the sets are disjoint, the number of dominators in $G\square H$ must be at least the sum of the cardinalities of these sets, namely $3\gamma \left(H\right)=\gamma \left(G\right)\gamma \left(H\right)$ . First, we assume that $G$ is 3-critical. This generalizes for all graphs with $\gamma \left(G\right)=3$ , by a bit of reasoning we will go through next. Without loss of generality, we can call the dominators of $G\left\{1,p,q\right\}$ , with $1=V\left(G\right)-N\left[p\right]\cup N\left[q\right]$ . A set with this property always exists in a 3-critical graph. Obviously 1 is adjacent to neither $p$ nor $q$ , but the proof must check the cases in which $p$ and $q$ are adjacent to each other and the case in which they are not. It uses these cases to build the appropriate subcases, and some of the math can be cumbersome and difficult to follow.

## The step to k-critical

This assumption is key to Sun's proof, but how does she justify this assumption? The k-critical assumption comes from a familiar trick that has been used in proofs for many simple inequalities including the AM-GM inequality. We start by generating an algorithm to raise or lower one side of the inequality while leaving the other unchanged. In the K-critical assumption we want to keep both $\gamma \left(G\right)$ and $\gamma \left(H\right)$ unchanged while lowering $\gamma \left(G\square H\right)$ . So the algorithm works as follows:

Application of nanotechnology in medicine
what is variations in raman spectra for nanomaterials
I only see partial conversation and what's the question here!
what about nanotechnology for water purification
please someone correct me if I'm wrong but I think one can use nanoparticles, specially silver nanoparticles for water treatment.
Damian
yes that's correct
Professor
I think
Professor
what is the stm
is there industrial application of fullrenes. What is the method to prepare fullrene on large scale.?
Rafiq
industrial application...? mmm I think on the medical side as drug carrier, but you should go deeper on your research, I may be wrong
Damian
How we are making nano material?
what is a peer
What is meant by 'nano scale'?
What is STMs full form?
LITNING
scanning tunneling microscope
Sahil
how nano science is used for hydrophobicity
Santosh
Do u think that Graphene and Fullrene fiber can be used to make Air Plane body structure the lightest and strongest. Rafiq
Rafiq
what is differents between GO and RGO?
Mahi
what is simplest way to understand the applications of nano robots used to detect the cancer affected cell of human body.? How this robot is carried to required site of body cell.? what will be the carrier material and how can be detected that correct delivery of drug is done Rafiq
Rafiq
if virus is killing to make ARTIFICIAL DNA OF GRAPHENE FOR KILLED THE VIRUS .THIS IS OUR ASSUMPTION
Anam
analytical skills graphene is prepared to kill any type viruses .
Anam
what is Nano technology ?
write examples of Nano molecule?
Bob
The nanotechnology is as new science, to scale nanometric
brayan
nanotechnology is the study, desing, synthesis, manipulation and application of materials and functional systems through control of matter at nanoscale
Damian
Is there any normative that regulates the use of silver nanoparticles?
what king of growth are you checking .?
Renato
What fields keep nano created devices from performing or assimulating ? Magnetic fields ? Are do they assimilate ?
why we need to study biomolecules, molecular biology in nanotechnology?
?
Kyle
yes I'm doing my masters in nanotechnology, we are being studying all these domains as well..
why?
what school?
Kyle
biomolecules are e building blocks of every organics and inorganic materials.
Joe
anyone know any internet site where one can find nanotechnology papers?
research.net
kanaga
sciencedirect big data base
Ernesto
Introduction about quantum dots in nanotechnology
hi
Loga
what does nano mean?
nano basically means 10^(-9). nanometer is a unit to measure length.
Bharti
how did you get the value of 2000N.What calculations are needed to arrive at it
Privacy Information Security Software Version 1.1a
Good
Got questions? Join the online conversation and get instant answers! By OpenStax By Robert Morris By OpenStax By Charles Jumper By Sandy Yamane By OpenStax By OpenStax By Sheila Lopez By Jonathan Long By Janet Forrester