Total Outer Equitable Connected Domination of a Graph

Journal Title: INTERNATIONAL JOURNAL OF MATHEMATICS TRENDS AND TECHNOLOGY - Year 2014, Vol 9, Issue 2

Abstract

Let G = (V, E) be a graph. A set D V (G) is equitable dominating set of G if v V – D a vertex u D such that uv E (G) and |d(u) – d(v)| 1. A set D V (G) is outer equitable dominating set if D is equitable dominating and is connected graph. The outer equitable connected domination number of G is the minimum cardinality of the outer-equitable connected dominating set of G and is denoted by oec(G). We introduce in this paper the concept of total outer equitable connected domination, exact values for some particular classes of graphs are found, some results on total outer equitable domination number are also established.

Authors and Affiliations

Jayaprakash M. C , Deepak G

Keywords

Related Articles

On Strongly πgr-Irresolute Functions

The purpose of this paper is to introduce strongly πgr-irresolute functions, strongly regular πgr-irresolute functions and strongly β- πgr-irresolute functions and study some of their basic properties. Also, some new for...

Total Outer Equitable Connected Domination of a Graph

Let G = (V, E) be a graph. A set D V (G) is equitable dominating set of G if v V – D a vertex u D such that uv E (G) and |d(u) – d(v)| 1. A set D V (G) is outer equitable dominating set if D is equitable dominati...

 Securing Server System from Buffer Overflow vulnerability using Vel-Alagar Algorithm

 Now a day’s buffer overflows have take place the most common target for network based attacks. The main proliferation method used by worms, malicious codes and improper coding by developers. Many techniques have be...

Common Fixed Point Theorems for Compatible Mappings in Metric Spaces

The aim of this paper to establish unique common fixed point theorems for compatible mappings in complete metric spaces and also illustrate the main theorem through a example.

(i,j) Strongly a**-Closed Sets in Bitopological Spaces

In this paper we introduce a new class of sets namely, (i,j) strongly α**-closed sets. Properties of this set are investigated and we introduce new spaces namely, (i,j)Tsα** spaces, (i,j)g*Tsα** spaces and (i,j)sg* Tsα**...

Download PDF file
  • EP ID EP94249
  • DOI -
  • Views 112
  • Downloads 0

How To Cite

Jayaprakash M. C, Deepak G (2014). Total Outer Equitable Connected Domination of a Graph. INTERNATIONAL JOURNAL OF MATHEMATICS TRENDS AND TECHNOLOGY, 9(2), 141-144. https://europub.co.uk/articles/-A-94249