In this paper, we define equitable eccentric domination in graphs. An eccentric dominating set S ⊆ V (G) of a graph G(V, E) is called an equitable eccentric dominating set if for every v ∈ V − S there exist at least one vertex u ∈ V such that |d(v) − d(u)| ≤ 1 where vu ∈ E(G). We find equitable eccentric domination number γeqed(G) for most popular known graphs. Theorems related to γeqed(G) have been stated and proved
AbstractThe eccentricity of a vertex is the maximum distance from it to another vertex and the avera...
A set D of vertices of a graph G = (VG, EG) is a dominating set of G if every vertex in VG — D is ad...
If A is an independent set of a graph G such that the vertices in A have pairwise different degrees...
In this paper, we define equitable eccentric domination in graphs. An eccentric dominating set S ⊆ V...
The study of domination in graphs is one of the fastest growing areas within graph theory. An excell...
We introduce transversal eccentric dominating(TED) set. An eccentric dominating set $D$ is called a ...
Copyright c © 2013 Dhananjaya Murthy B. V et al. This is an open access article dis-tributed under t...
Abstract: Let G = (V,E) be a graph, D ⊆ V and u be any vertex in D. Then the out degree of u with re...
A subset D of ()V G is called an equitable dominating set if for every ()v V G D , there exists a...
In this paper we introduce the superior eccentric domination polynomial $SED(G, φ) = β\sum_{ l=\gamm...
Let G = (V,E) be a graph. A subset D of V is called an equitable dominating set of a graph G if for ...
A subset D ⊆ V(G) is called an equitable dominating set of a graph G if every vertex v ∈ V(G) \ D ha...
AbstractThe minimum eccentric dominating graph MmDE(G) of a graph G is defined to be the intersectio...
In a fuzzy graph G(ρ, μ), a dominating set D ⊆ P(G) is said to be g-eccentric if at least one g-ecce...
Let $delta (G)$, $Delta (G)$ and $gamma(G)$ be the minimum degree, maximum degree and domin...
AbstractThe eccentricity of a vertex is the maximum distance from it to another vertex and the avera...
A set D of vertices of a graph G = (VG, EG) is a dominating set of G if every vertex in VG — D is ad...
If A is an independent set of a graph G such that the vertices in A have pairwise different degrees...
In this paper, we define equitable eccentric domination in graphs. An eccentric dominating set S ⊆ V...
The study of domination in graphs is one of the fastest growing areas within graph theory. An excell...
We introduce transversal eccentric dominating(TED) set. An eccentric dominating set $D$ is called a ...
Copyright c © 2013 Dhananjaya Murthy B. V et al. This is an open access article dis-tributed under t...
Abstract: Let G = (V,E) be a graph, D ⊆ V and u be any vertex in D. Then the out degree of u with re...
A subset D of ()V G is called an equitable dominating set if for every ()v V G D , there exists a...
In this paper we introduce the superior eccentric domination polynomial $SED(G, φ) = β\sum_{ l=\gamm...
Let G = (V,E) be a graph. A subset D of V is called an equitable dominating set of a graph G if for ...
A subset D ⊆ V(G) is called an equitable dominating set of a graph G if every vertex v ∈ V(G) \ D ha...
AbstractThe minimum eccentric dominating graph MmDE(G) of a graph G is defined to be the intersectio...
In a fuzzy graph G(ρ, μ), a dominating set D ⊆ P(G) is said to be g-eccentric if at least one g-ecce...
Let $delta (G)$, $Delta (G)$ and $gamma(G)$ be the minimum degree, maximum degree and domin...
AbstractThe eccentricity of a vertex is the maximum distance from it to another vertex and the avera...
A set D of vertices of a graph G = (VG, EG) is a dominating set of G if every vertex in VG — D is ad...
If A is an independent set of a graph G such that the vertices in A have pairwise different degrees...
DOI
Add to ORKG