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

E-Learning: An Effective virtual way to understand the physical world

The objective of physical laboratory training is to provide an experimental base for the theoretical concepts introduced during the lectures. It gives an opportunity to students to verify ideas which they learn in theory...

Methods for Protein Structure Prediction and Its Application in Drug Design Using Hidden Markov Model

Drug design and drug innovation are critical importance in human fitness. To design a drug must successfully to the compound target from the substitute structures present in the organism. Many traditional methods are use...

Efficient scheduling Algorithm for Satisfying SLA between Cloud and Users

Testing assume a vital part in programming improvement cycle. In the interim, distributed computing has gotten to be one of the important patterned at data innovation. Founded on top of virtualization innovation, distrib...

Similar Characteristics of Fibrillar form of β-Amyloid Peptide Fractions from Mice Brain affected by Systemic Amyloidosis

Enhanced expression of amyloid β-peptide (Aβ) and deposition is the main causative factor in Alzheimer’s disease (AD). Factors that lead to the genesis of accumulation and toxicity of Aβs are yet to be identified. While...

Perception of Drinking Water and Diseases Associated with it in the Rural Areas of Sindh, Pakistan

In the rural areas the vast majority of people mostly on drinking ground water. Ground water in some areas contains contaminants and heavy metals, and bacteria and amoeba and other pathogens, which might cause number of...

Download PDF file
  • EP ID EP243435
  • DOI -
  • Views 102
  • 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