An Algorithm for 2-Tuple Total Domination Number in Circulant Graphs

Abstract

This paper studies perfect 2-tuple total domination number for the circulant graphs Cir(n, A) , where A ={1,2,...,x,n 1,n  2,...,n  x} and 1 2 n x         from an algorithmic point of view.

Authors and Affiliations

A. Shobana

Keywords

Related Articles

Collaborative Filtering Recommender System

There has been an increase in the number of services available in the internet .Datasets are growing at a fast pace as it is being gathered and generated by a number of devices like smartphones, tablets and various infor...

ater Quality Analysis of Muttar River

he Muttar River is an extremely polluted fresh water source with degrading water quality and flow. The river has a twelve kilometer length and an average width of fifty meters.According to t...

The Role of Optical Amplifiers in Soliton Communication System: A Review

The soliton is an innovative area of research that deserves intense investigation in many branches of physics. Different class of soliton-bearing models has been proposed in many physical problems in various context of p...

Turbo-matching of A58N70 Turbo-charger for a Commercial Vehicle Engine

Turbocharger is a Charge booster, which helps the automobiles, especially at higher loads by providing best operating performance. The adaption of such turbocharger for the desired engine is a tedious job and requires in...

Evaluation of Drainage Systems in Sekarbela Area and its Surroundings

Floods that happened in some place of Mataram City in December 2016 at Area of Sekarbela generate many question in society, what becoming cause of that floods, is purification because high rainfall, lack...

Download PDF file
  • EP ID EP240972
  • DOI -
  • Views 77
  • Downloads 0

How To Cite

A. Shobana (2015). An Algorithm for 2-Tuple Total Domination Number in Circulant Graphs. International journal of Emerging Trends in Science and Technology, 2(6), 2535-2537. https://europub.co.uk./articles/-A-240972