The Journal of the Indian Mathematical Society

Open Access Open Access  Restricted Access Subscription Access
Open Access Open Access Open Access  Restricted Access Restricted Access Subscription Access

Complementary Acyclic Domination in Graphs


Affiliations
1 Department of Planning, Bangalore-560 001, India
2 Department of Mathematics, Mysore University, Mysore-570 006, India
3 Department of Mathematics, Kristu Jayanti College, Bangalore-560 077, India
     

   Subscribe/Renew Journal


Let G = (V, E) be a graph. A set D ⊆ V is said to be a complementary acyclic dominating set if every vertex in V - D is adjacent to some vertex in D and the induced subgraph (V - D) has no cycles. In this paper, we initiate a study of complementary acyclic domination and relate the complementary acyclic domination number with other domination parameters.

Keywords

Domination, Acyclic, Acyclic Domination.
Subscription Login to verify subscription
User
Notifications
Font Size



  • Complementary Acyclic Domination in Graphs

Abstract Views: 316  |  PDF Views: 0

Authors

B. Janakiram
Department of Planning, Bangalore-560 001, India
N. D. Soner
Department of Mathematics, Mysore University, Mysore-570 006, India
M. A. Davis
Department of Mathematics, Kristu Jayanti College, Bangalore-560 077, India

Abstract


Let G = (V, E) be a graph. A set D ⊆ V is said to be a complementary acyclic dominating set if every vertex in V - D is adjacent to some vertex in D and the induced subgraph (V - D) has no cycles. In this paper, we initiate a study of complementary acyclic domination and relate the complementary acyclic domination number with other domination parameters.

Keywords


Domination, Acyclic, Acyclic Domination.