Add to ORKGLet G = (V, E) be a simple graph. A set S ⊆ E(G) is an edge-vertex dominating set of G (or simply an ev-dominating set), if for all vertices v ∈ V(G); there exists an edge e∈S such that e dominates v. Let ()ev nD C i, denote the family of all ev-dominating sets of nC with cardinality i. Let ( ) ()ev n ev nd C i D C i,, =. In this paper, we obtain a recursive formula for ()ev nd C i,. Using this re-cursive formula, we construct the polynomial, ( ) () ∑n iev n ev nniD C x d C i x 4 = , which we call edge-vertex domination polynomial of nC (or simply an ev-domination polynomial of nC) and obtain some properties of this polynomial
A vertex v of a graph \(G=(V,E)\) is said to vertex-edge dominate every edge incident to v as well a...
In this paper we study graph parameters related to vertex-edge domination, where a vertex dominates ...
Let \(G=(V,E)\) be a simple graph. A set \(S\subseteq V\) is a dominating set if every vertex in \(V...
An edge e ev-dominates a vertex v which is a vertex of e, as well as every vertex adjacent to v. A s...
ABSTRACT—Let be a simple graph. set is a dominating set of, if every vertex in is adjacent to at le...
The domination polynomial of a graph G of order n is the polynomial [formula] where d(G, i) is the n...
An edge domination polynomial of a graph G is the polynomial where de(G, t) is the number of edge d...
Let G V, E be a simple graph. A set S ⊆ V is a dominating set of G, if every vertex in V \S is adj...
AbstractA set S of vertices in a graph G is said to be an edge-dominating set if every edge in G is ...
An edge in a graph G = (V, E) is said to ev-dominate the vertices incident to it as well as the vert...
Most of the research on domination focuses on vertices dominating other vertices. In this paper we c...
Let G=(V,E) be a graph with vertex set V and edge set E. A vertex v∈V ve-dominates every edge incide...
Let G =(V,E) be a finite undirected graph. A set F of the edges of a graph G is an edge dominating s...
An edge e is an element of E(G) dominates a vertex v is an element of V (G) if e is incident with v ...
Let G = (V,E) be a simple graph. A set S ⊆ V is a dominating set of graph G, if every vertex in V − ...
A vertex v of a graph \(G=(V,E)\) is said to vertex-edge dominate every edge incident to v as well a...
In this paper we study graph parameters related to vertex-edge domination, where a vertex dominates ...
Let \(G=(V,E)\) be a simple graph. A set \(S\subseteq V\) is a dominating set if every vertex in \(V...
An edge e ev-dominates a vertex v which is a vertex of e, as well as every vertex adjacent to v. A s...
ABSTRACT—Let be a simple graph. set is a dominating set of, if every vertex in is adjacent to at le...
The domination polynomial of a graph G of order n is the polynomial [formula] where d(G, i) is the n...
An edge domination polynomial of a graph G is the polynomial where de(G, t) is the number of edge d...
Let G V, E be a simple graph. A set S ⊆ V is a dominating set of G, if every vertex in V \S is adj...
AbstractA set S of vertices in a graph G is said to be an edge-dominating set if every edge in G is ...
An edge in a graph G = (V, E) is said to ev-dominate the vertices incident to it as well as the vert...
Most of the research on domination focuses on vertices dominating other vertices. In this paper we c...
Let G=(V,E) be a graph with vertex set V and edge set E. A vertex v∈V ve-dominates every edge incide...
Let G =(V,E) be a finite undirected graph. A set F of the edges of a graph G is an edge dominating s...
An edge e is an element of E(G) dominates a vertex v is an element of V (G) if e is incident with v ...
Let G = (V,E) be a simple graph. A set S ⊆ V is a dominating set of graph G, if every vertex in V − ...
A vertex v of a graph \(G=(V,E)\) is said to vertex-edge dominate every edge incident to v as well a...
In this paper we study graph parameters related to vertex-edge domination, where a vertex dominates ...
Let \(G=(V,E)\) be a simple graph. A set \(S\subseteq V\) is a dominating set if every vertex in \(V...