# 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}$ The cartesian product of 2 complete graphs makes a "cheese block"

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

where we get a research paper on Nano chemistry....?
nanopartical of organic/inorganic / physical chemistry , pdf / thesis / review
Ali
what are the products of Nano chemistry?
There are lots of products of nano chemistry... Like nano coatings.....carbon fiber.. And lots of others..
learn
Even nanotechnology is pretty much all about chemistry... Its the chemistry on quantum or atomic level
learn
da
no nanotechnology is also a part of physics and maths it requires angle formulas and some pressure regarding concepts
Bhagvanji
hey
Giriraj
Preparation and Applications of Nanomaterial for Drug Delivery
revolt
da
Application of nanotechnology in medicine
what is variations in raman spectra for nanomaterials
ya I also want to know the raman spectra
Bhagvanji
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
Nasa has use it in the 60's, copper as water purification in the moon travel.
Alexandre
nanocopper obvius
Alexandre
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
Any one who tell me about Preparation and application of Nanomaterial for drug Delivery
Hafiz
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
Got questions? Join the online conversation and get instant answers! By OpenStax By Jessica Collett By OpenStax By OpenStax By OpenStax By Michael Sag By OpenStax By Sandhills MLT By Brenna Fike By OpenStax