Publication


Featured researches published by N. D. Soner.


Journal of Discrete Mathematical Sciences and Cryptography | 2007

Complementary total domination in graphs

B. Chaluvaraju; N. D. Soner

Abstract Let D be a minimum total dominating set of G. If V−D contains a total dominating set (TDS) say S of G, then S is called a complementary total dominating set with respect to D. The complementary total domination number γ ct (G) of G is the minimum number of vertices in a complementary total dominating set (CTDS) of G .In this paper, exact values of γ ct (G) for some standard graphs are obtained. Also its relationship with other domination related parameters are investigated.


Archive | 2009

Roman edge domination in graphs

N. D. Soner; B. Chaluvaraju; J. P. Srivastava


Archive | 2008

The split domination number of fuzzy graphs

Q. M. Mahyoub; N. D. Soner


Archive | 2006

The connected total domination number of a graph

V. R. Kulli; N. D. Soner


Archive | 2004

Complementary acyclic domination in graphs

B. Janakiram; N. D. Soner; M. A. Davis


Ultra Scientist, | 2008

The split edge domination number of a graph

K. M. Yogeesha; N. D. Soner; S. Ghobadi


Archive | 2007

The double bondage number of a graph

K. M. Yogeesha; N. D. Soner


Archive | 2008

Inverse dominating set in fuzzy graphs

S. Ghobadi; N. D. Soner; Q. M. Mahyoub


Archive | 2008

The nomatic number problem in interval graphs

S. Ghobadi; N. D. Soner


Archive | 2006

Paired neighborhood in graphs.

N. D. Soner; B. Chaluvaraju; K. M. Yogeesha

Researchain Logo
Decentralizing Knowledge