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
- EP ID EP94249
- DOI -
- Views 113
- Downloads 0
Characterizations of k-normal matrices
In this paper to extend and generalize lists of characterizations of k-normal and k-hermitian matrices known in the literature, by providing numerous sets of equivalent conditions referring to the notions of co...
Normalized Hamming Similarity Measure for Intuitionistic Fuzzy Multi Sets and Its Application in Medical Diagnosis
As Similarity measure for fuzzy sets is one of the important research topics of fuzzy set theory, there are several methods to measure similarity between two fuzzy sets (FS), Intuitionistic fuzzy sets (IFS) and Intuition...
Bayesian Analysis of Extended Lomax Distribution
In this paper, the Markov chain Monte Carlo (MCMC) method is used to estimate the parameters of Extended Lomax distribution, based on a complete sample. The proposed methodology can be used to obtain the Bayes estimates...
A Study of an Inflationary Inventory Model with Stock-Dependent Demand and Shortages
An inventory replenishment problem for a deteriorating item is considered over a finite time-horizon with shortages in all cycles and stock-dependent demand rate. The effects of inflation and time-value of money are also...
On Edge Pair Sum Labeling of Graphs
An injective map f : E(G) → {±1,±2,…,±q} is said to be an edge pair sum labeling of a graph G(p, q) if the induced vertex function f^*:V(G)→Z-{0} defined by f^* (v)=∑_(e∊E_v)▒f(e) is one – one, where E_v denotes the set...