Complementary Acyclic Domination in Graphs

Jump To References Section

Authors

  • Department of Planning, Bangalore-560 001 ,IN
  • Department of Mathematics, Mysore University, Mysore-570 006 ,IN
  • Department of Mathematics, Kristu Jayanti College, Bangalore-560 077 ,IN

Keywords:

Domination, Acyclic, Acyclic Domination.

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.

Downloads

Download data is not yet available.

Metrics

Metrics Loading ...

Published

2004-12-01

How to Cite

Janakiram, B., Soner, N. D., & Davis, M. A. (2004). Complementary Acyclic Domination in Graphs. The Journal of the Indian Mathematical Society, 71(1-4), 221–226. Retrieved from http://www.informaticsjournals.com/index.php/jims/article/view/22044