Open Daily: 10am - 10pm | Alley door pickup 10am - 7pm 3038 Hennepin Ave Minneapolis, MN
612-822-4611

  • Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Graph Critical with Respect to Variants of Domination

Graph Critical with Respect to Variants of Domination

Bosamiya Jeegnesh Chhabilbhai
Thakkar Dineshbhai Keshvlal

Paperback

General Mathematics

Currently unavailable to order

ISBN10: 3659286087
ISBN13: 9783659286087
Publisher: Lap Lambert Academic Pub
Published: Oct 31 2012
Pages: 132
Weight: 0.45
Height: 0.31 Width: 6.00 Depth: 9.00
Language: English
Chapter-0 provides an introduction to domination and its variants. Some fundamental results regarding domination and its variants, and historical background of domination In chapter-1 we define the concept of extended and total extended number for any graph. We also characterized those vertices whose removal increases or decreases or does not change extended total domination number of a graph. Chapter-2 contains the concept of independent domination and vertex covering of a graph.We prove that vertex covering number of graph never increase when a vertex is removed from the graph. We prove that if a graph vertex transitive graph then the intersection of all minimum vertex covering sets is empty. We also prove that a vertex transitive graph with even number of vertices is bipartite if and only if it has exactly two minimum vertex covering sets. chapter 3-4 contains total k-domination, k-tuple k-domination and k-dependent k-domination and perfect domination.Here also we define this concept and characterized those vertices whose removal increase or decreases the total k-domination number and k-tuple domination number and k-dependent k-domination number, perfect domination number.

Also in

General Mathematics

View All