53 views

Uploaded by api-270305905

save

You are on page 1of 23

of Cm Cn .

Michael Young

Iowa State University

Chassidy Bozeman

Josh Carlson

Michael Dairyko

Derek Young

Exponential Domination

w : V (G ) V (G ) R.

For u, v V (G ), we say that u assigns weight w (u, v ) to v .

For a set S V (G ) we denote

w (S, v ) :=

w (s, v ).

sD

Exponential Domination

Types of Domination

1. Domination:

1 if v N(u)

0 otherwise.

1 if v N(u)

0 otherwise.

w (u, v ) =

2. Total Domination:

w (u, v ) =

3. k-Domination:

1/k if v N(u)

1

if v = u

w (u, v ) =

0

otherwise.

Exponential Domination

An exponential dominating set of a graph G is a set D V (G ) such that

(D, w ) dominates G when w (u, v ) = ( 21 )dist(u,v )1 .

The exponential domination number of G , denoted by e (G ), is the

cardinality of a minimum exponential dominating set.

Exponential Domination

An exponential dominating set of a graph G is a set D V (G ) such that

(D, w ) dominates G when w (u, v ) = ( 21 )dist(u,v )1 .

The exponential domination number of G , denoted by e (G ), is the

cardinality of a minimum exponential dominating set.

Exponential Domination

Cm x Cn

Exponential Domination

Cm x Cn

Goal: Determine

e (Cm Cn )

.

mn

Exponential Domination

Naive Lower Bound:

Exponential Domination

Naive Lower Bound:

Let v V (Cm Cn ).

Exponential Domination

Naive Lower Bound:

Let v V (Cm Cn ).

There are at most 4d vertices that are distance d > 0 from v .

Exponential Domination

Naive Lower Bound:

Let v V (Cm Cn ).

There are at most 4d vertices that are distance d > 0 from v .

So w (v , V (Cm Cn )) 2 +

4d21d = 18.

d=1

Exponential Domination

Naive Lower Bound:

Let v V (Cm Cn ).

There are at most 4d vertices that are distance d > 0 from v .

So w (v , V (Cm Cn )) 2 +

4d21d = 18.

d=1

Therefore, mn

v D

Exponential Domination

Naive Lower Bound:

Let v V (Cm Cn ).

There are at most 4d vertices that are distance d > 0 from v .

So w (v , V (Cm Cn )) 2 +

4d21d = 18.

d=1

Therefore, mn

1

18

v D

e (Cm Cn )

.

mn

Exponential Domination

For all m and n,

1

e (Cm Cn )

.

13

mn

Exponential Domination

For all m, n 3,

1

e (G )

1

<

+ o(1)

15.875

mn

13

.

Exponential Domination

Upper bound:

Exponential Domination

Proof of lower bound:

Exponential Domination

Theorem (BCDYY)

For all m, n 13,

e (Cm Cn )

1

,

13.7619 +

mn

where 0 as m, n .

Exponential Domination

x1

x2

x3 x4

x5

x8

Exponential Domination

min c T x

s.t. Ax 1

Ax b

x 0

where A is the r r matrix where the ijth entry is

x = [x1 , x2 , . . . , xr 2 ]T .

1 dist(vi ,vj )

2

and

Exponential Domination

Theorem (BCDYY)

Let D be an exponential dominating set of Cm Cn and |D| be the

number of vertices in D that are not within a 7 7 grid of any other

vertex in D. Then

1

(Cm Cn )

,

13.7619 2.8218

mn

where 0 as m, n .

Future Directions

Prove

1

13 .

Other grids and graphs.

Thank You!

- miaa 320 dap pdfUploaded byapi-268934937
- Baltic 01Uploaded byMauricio Mallma
- SolutionsUploaded bySanjeev Baghoriya
- A New Algorithm for Backbone Formation in AdUploaded byJitender Grover
- exsht2Uploaded bysticker592
- 43621-TahaSMCh01.pdfUploaded byrobby
- Ceng583 PresentationUploaded byMehmet Akif Akkus
- CalculusUploaded byMarjenneil
- MaulisaDewi-17482Uploaded byNadia Elaesiana
- CodeUploaded byminhtaiet1711
- Generalized 2 Complement of Set DominationUploaded byIJSTR Research Publication
- v3.Si1 .23.Inverse Domination of Divisor Cayley GraphsUploaded byJeelani.S
- Mm Solaf Paper 2 Set 2Uploaded bySean Gomez
- plan-j math frm 3Uploaded bytansherlene
- 354082212-Solutions-Manual-Introduction-to-Finite-Elements-in-Engineering-4th-Edition-Tirupathi-R-Chandrupatla-Ashok-D-Belegundu.pdfUploaded byKOKOLE
- Emre_RinkouUploaded byHashimoto Laboratory
- Chap 10 Solutions Ex 10 1 MethodUploaded byMuhammad Salman
- OldUploaded bymangalvao2009
- GATE 2014 Computer Science Sample Paper Answer KeyUploaded byRubina Nigadi
- PertUploaded bySarfaraj Ovi
- Data Structures & AlgorithmsUploaded bySidharth Shekhar
- Afternotes on Numerical AnalysisUploaded byDavid James Finder
- Deepanjan Basu ElsevierUploaded byPhani Kanth Vedula
- AcodsAutomatic Generation Control of Single Area Thermal Power System with Fractional Order PID (PIλDμ) ControllersUploaded byemyimran
- Graphing ActivitiesUploaded byddlu123
- Pn as JournalUploaded byRachael Clark
- Juniors RelayUploaded bymathsociety
- computersciencelesson05 02handshakeandfencepostactivityUploaded byapi-271183412
- AlgoritmosUploaded by_wilmary_
- 73 220 Lecture14 SolnUploaded byapi-26315128

- 2-ambirikaUploaded byapi-270305905
- sacnas 2016 collaboration funding request formUploaded byapi-270305905
- sacnasdiazlopezUploaded byapi-270305905
- sacnas-2016-luis-garciaUploaded byapi-270305905
- sacnas2016-origamiUploaded byapi-270305905
- talk sacnas 2016 finalUploaded byapi-270305905
- sacnas16 catral-handoutUploaded byapi-270305905
- sacnas ivy presentation2Uploaded byapi-270305905
- 2014losangelessacnasUploaded byapi-270305905
- rorellanaUploaded byapi-270305905
- 3-rwilliamsUploaded byapi-270305905
- fardilaUploaded byapi-270305905
- cwaltonUploaded byapi-270305905
- egoinsUploaded byapi-270305905
- 1-dlewisUploaded byapi-270305905

- BookUploaded bySaroj Kumar Rai
- journal of computer science Constraint Minimum Vertex Cover in K-Partite Graph: Approximation Algorithm and Complexity AnalysisUploaded byijcsis
- Binomial theoremUploaded byjOhNyDoN21
- Olympiad CombinatoricsUploaded byCông Cường Trương
- COMPONENTES FUERTEMENTE CONEXASUploaded byOscar Pavon
- Programacion Lineal RedesUploaded byItzchel Chuchuluco
- Teoria de Grafos1Uploaded byUgueto Diogenes
- programación linealUploaded bySara Peña
- Chapitre IIIUploaded byMouad Riyad
- Exercices Probabilités 2016Uploaded bybilal daoudi
- MA1301 Help SheetUploaded byChng Pei Sze
- Ch03 Matric Science Moin LatifUploaded byAli
- A Little Bit of Classics_ Dynamic Programming Over Subsets and Paths in Graphs - CodeforcesUploaded byCognizance_IITR
- Common Derivatives & IntegralsUploaded bystr8spades
- tx114301.pdfUploaded byJu Catarina Pendão
- Logaritmos - Teoría y ProblemasUploaded bycarlos_kard0322688
- Edexcel C3 Trigonometry & Differentiation.pdfUploaded bysg note
- Algorithms and Complexity IIUploaded bySly2518
- Tsp SolutionsUploaded byHaidEn Lios
- 6 2 Hyperbolic FunctionsUploaded byEbookcraze
- D1 Revision SheetUploaded bymunashresthaa
- invdual-mat.docxUploaded byMuhammad Muizzudin
- Domino TilingsUploaded byZulqarnayn
- Family of sets_2.pdfUploaded bymars
- EulerPather Optimal LayoutUploaded byAbhimanyu Yadav
- SortingUploaded byFatima Shakeel
- 16.3 Distinguishable PermutationsUploaded byPaula Jan
- Random Graphs and Complex NetworksUploaded bypasomaga
- D1 Practice Paper a Mark SchemeUploaded byKelvin Yeung
- Funciones Para Graficar en GeogebraUploaded byObatala En El Paisaje Noctambulo