The following information was submitted:
Transactions: WSEAS TRANSACTIONS ON MATHEMATICS
Transactions ID Number: 53-734
Full Name: Sundareswaran Raman
Position: Assistant Professor
Age: ON
Sex: Male
Address: Rajalakshmi Engg.College, Chennai , Tamilnadu, India
Country: INDIA
Tel:
Tel prefix:
Fax:
E-mail address: neyamsundar@yahoo.com
Other E-mails:
Title of the Paper: Computation Complexity of Domination Integrity in graphs
Authors as they appear in the Paper: sundareswaran raman , swaminathan venkataraman
Email addresses of all the authors: neyamsundar@yahoo.com, sulanesri@yahoo.com
Number of paper pages: 10
Abstract: C.A. Barefoot, et. al. introduced the concept of the integrity of a graph. It is an useful measure of vulnerability and it is defined as follows. I(G) = min{ G +m(G−S) : S V (G) where m(G−S) denotes the order of the largest component in G − S}. Unlike the connectivity measures, integrity shows not only the difficulty to break down the network but also the damage that has been caused.Two concepts both important in their own ways are that of domination and integrity. While domination is useful in determining decision making bodies of minimum strength or weakness of a network when certain part of it is paralyzed. In the case of a disruption of a network, the damage will be more when vital nodes are under siege. This motivated the study of domination integrity when the sets of nodes disturbed are dominating sets. In this paper, the computational complexity of Domination Integrity is discussed
Keywords: Integrity,Domination Integrity
EXTENSION of the file: .pdf
Special (Invited) Session:
Organizer of the Session:
How Did you learn about congress: Integrity, Domination, Domination integrity
IP ADDRESS: 59.92.118.185
