Irredundant Complete Domination Number of Graphs

Abstract

The concept of complete graphs with real life application was introduced in [17] .In [14] , A. Nellai Murugan et.al., was introduced the concept of complete dominating number of a graph. In this paper, We introduce a new domination parameter called Irredundant complete dominating set of K4 -e , A subset S of V of a non trivial graph G is called a dominating set of G if every vertex in V-S is adjacent to at least one vertex in S. The domination number of G is the minimum cardinality taken over all dominating set in G. A subset S of V of a nontrivial graph G is said to be complete dominating set, If for each denoted by S’ is the complete dominating set. The minimum cardinality taken over all complete dominating set is called the complete domination number and is denoted by [14].A set is said to be redundant in S if othewise x is said to be irredundant in S . Finally , S is called an irredundant set if all are irredundant in S , Otherwise S is a redundant set .A subset S of v of a nontrivial graph G is said to be an Irredundant complete dominating set if S is an irredundant and complete . The minimum cardinality taken over all an irredundant complete dominating set is called an Irredundant complete domination number and is denoted by . Mathematics Subject Classification: 05C69

Authors and Affiliations

A. Nellai Murugan

Keywords

Related Articles

Performance Evaluation of Mutual Funds and Unit Linked Insurance Plans in India: An Empirical Study of Equity-Based Funds

India is re-emerging as an economic power on the world stage with its rapidly growing economy becoming an investment led economy. Ever expanding impact of economic liberalization, privatization and globalization; growing...

An Another Generalized Fibonacci Sequence

In this paper, we establish a generalized Fibonacci sequence defined by n n n n n n n n n 1 2 3 4 5 6 7 8 S S S S S S S S S                 . Some properties of sequence (Sn) are also established.

Risc Processor Using VHDL

Reduced Instruction Set Computer (RISC) is become a design theory that has accepted in engineering applications. Optimizing gate capacity and performance of FPGA kit. This devices provides complex logic systems to be per...

Mining Comparators from Comparative Questions

One of the essential parts of human life is to compare one thing with another in order to take proper decisions. But it is difficult to find what parameters to compare and what could be the alternatives for it. To solve...

Paper on Basics of Internet of Things

The term Internet of Things generally refers to scenarios where network connectivity and computing capability extends to objects, sensors and everyday items not normally considered computers, allowing these devices to ge...

Download PDF file
  • EP ID EP243435
  • DOI -
  • Views 103
  • Downloads 0

How To Cite

A. Nellai Murugan (2016). Irredundant Complete Domination Number of Graphs. International journal of Emerging Trends in Science and Technology, 3(3), 3638-3646. https://europub.co.uk./articles/-A-243435