• date post

18-Dec-2015
• Category

## Documents

• view

212

0

Embed Size (px)

### Transcript of Weakly Connected Domination Koh Khee Meng Department of Maths National U of Singapore...

• Slide 1
• Weakly Connected Domination Koh Khee Meng Department of Maths National U of Singapore matkohkm@nus.edu.sg
• Slide 2
• Three Related Dominations V S
• Slide 3
• domination number The domination number of G = (G) = min{| S | : S is a ds in G}. -set Call a minimum ds of G a -set of G.  1 st survey paper by Cockayne & Hedetniemi
• Slide 4
• connected ds A ds S is called a connected ds if the induced subgraph [S] of G is connected.  Sampathkumar & Walikar
• Slide 5
• Disjoint union of two K(1, 3)s
• Slide 6
• weakly connected ds wcds A ds S of G is a weakly connected ds (wcds) of G if is connected. Connected
• Slide 7
• Slide 8
• weakly connected domination The weakly connected domination was first introduced by Grossman (1997)
• Slide 9
• Slide 10
• Slide 11
• Relations with other parameters
• Slide 12
• Slide 13
• Sanchis works
• Slide 14
• Slide 15
• Trees
• Slide 16
• Slide 17
• Slide 18
• Slide 19
• Slide 20
• Cycle-e-disjoint Graph Cactus Cycle-e-disjoint Graph (Cactus)
• Slide 21
• Lemanska (2007) Koh & Xu (2008) Extended the above to unicyclic graphs.
• Slide 22
• cactus Let G be a cactus of order n 3; z(G) = number of end-vertices, c(G) = number of cycles, oc(G) = number of odd cycles in G.
• Slide 23
• Cacti Cacti for which equality holds are characterized.
• Slide 24
• Slide 25
• Slide 26
• Slide 27