# 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]

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
what does nano mean?
nano basically means 10^(-9). nanometer is a unit to measure length.
Bharti
do you think it's worthwhile in the long term to study the effects and possibilities of nanotechnology on viral treatment?
absolutely yes
Daniel
how to know photocatalytic properties of tio2 nanoparticles...what to do now
it is a goid question and i want to know the answer as well
Maciej
Abigail
for teaching engĺish at school how nano technology help us
Anassong
Do somebody tell me a best nano engineering book for beginners?
there is no specific books for beginners but there is book called principle of nanotechnology
NANO
what is fullerene does it is used to make bukky balls
are you nano engineer ?
s.
fullerene is a bucky ball aka Carbon 60 molecule. It was name by the architect Fuller. He design the geodesic dome. it resembles a soccer ball.
Tarell
what is the actual application of fullerenes nowadays?
Damian
That is a great question Damian. best way to answer that question is to Google it. there are hundreds of applications for buck minister fullerenes, from medical to aerospace. you can also find plenty of research papers that will give you great detail on the potential applications of fullerenes.
Tarell
what is the Synthesis, properties,and applications of carbon nano chemistry
Mostly, they use nano carbon for electronics and for materials to be strengthened.
Virgil
is Bucky paper clear?
CYNTHIA
carbon nanotubes has various application in fuel cells membrane, current research on cancer drug,and in electronics MEMS and NEMS etc
NANO
so some one know about replacing silicon atom with phosphorous in semiconductors device?
Yeah, it is a pain to say the least. You basically have to heat the substarte up to around 1000 degrees celcius then pass phosphene gas over top of it, which is explosive and toxic by the way, under very low pressure.
Harper
Do you know which machine is used to that process?
s.
how to fabricate graphene ink ?
for screen printed electrodes ?
SUYASH
What is lattice structure?
of graphene you mean?
Ebrahim
or in general
Ebrahim
in general
s.
Graphene has a hexagonal structure
tahir
On having this app for quite a bit time, Haven't realised there's a chat room in it.
Cied
what is biological synthesis of nanoparticles
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!