Superior domination polynomial SD(G, x) is a polynomial in which the power of the variable denotes the cardinality of a superior dominating set and the total number of sets of same cardinality forms the coefficient of the variable. In this paper we find the SD(Cn, x) of cycle graphs. The results related to the polynomial SD(Cn, x) is stated and the proved
Let G = (V, E) be a simple graph. A set S ⊆ E(G) is an edge-vertex dominating set of G (or simply an...
In his 1992 Ph.D. thesis Chang identified an efficient way to dominate m-by-n grid graphs and conjec...
A dominating set in a graph G is a set S of vertices of G such that every vertex not in S is adjacen...
Superior domination polynomial SD(G, x) is a polynomial in which the power of the variable denotes t...
The domination polynomial of a graph G of order n is the polynomial [formula] where d(G, i) is the n...
In this paper we introduce the superior eccentric domination polynomial $SED(G, φ) = β\sum_{ l=\gamm...
An edge domination polynomial of a graph G is the polynomial where de(G, t) is the number of edge d...
ABSTRACT—Let be a simple graph. set is a dominating set of, if every vertex in is adjacent to at le...
This thesis introduces domination polynomial of a graph. The domination polynomial of a graph G of o...
A set D ⊆ V (G) is a dominating set of G if every vertex not in D is adjacent to at least one vertex...
A subset S of a vertex set V is called a dominating set of graph G if every vertex of V -S is domina...
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...
In this paper we explore the concept of strong domination number and investigate strong domination n...
AbstractLet G be a simple graph of order n. The domination polynomial of G is the polynomial D(G,x)=...
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...
Let G = (V, E) be a simple graph. A set S ⊆ E(G) is an edge-vertex dominating set of G (or simply an...
In his 1992 Ph.D. thesis Chang identified an efficient way to dominate m-by-n grid graphs and conjec...
A dominating set in a graph G is a set S of vertices of G such that every vertex not in S is adjacen...
Superior domination polynomial SD(G, x) is a polynomial in which the power of the variable denotes t...
The domination polynomial of a graph G of order n is the polynomial [formula] where d(G, i) is the n...
In this paper we introduce the superior eccentric domination polynomial $SED(G, φ) = β\sum_{ l=\gamm...
An edge domination polynomial of a graph G is the polynomial where de(G, t) is the number of edge d...
ABSTRACT—Let be a simple graph. set is a dominating set of, if every vertex in is adjacent to at le...
This thesis introduces domination polynomial of a graph. The domination polynomial of a graph G of o...
A set D ⊆ V (G) is a dominating set of G if every vertex not in D is adjacent to at least one vertex...
A subset S of a vertex set V is called a dominating set of graph G if every vertex of V -S is domina...
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...
In this paper we explore the concept of strong domination number and investigate strong domination n...
AbstractLet G be a simple graph of order n. The domination polynomial of G is the polynomial D(G,x)=...
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...
Let G = (V, E) be a simple graph. A set S ⊆ E(G) is an edge-vertex dominating set of G (or simply an...
In his 1992 Ph.D. thesis Chang identified an efficient way to dominate m-by-n grid graphs and conjec...
A dominating set in a graph G is a set S of vertices of G such that every vertex not in S is adjacen...
DOI
Add to ORKG