Add to ORKGIn this paper we will consider independent sets and independent dominating sets in the strong product of two paths,two cycles and a path and a cycle
The problems of determining the maximum cardinality of an independent set of vertices and the minimu...
AbstractLet k⩾2,n=2k+1, and let m0,…,mk−1 each be a multiple of n. The graph Cm0×⋯×Cmk−1 consists of...
[EN] A set D of vertices of a graph G is a total dominating set if every vertex of G is adjacent to ...
Independent sets and independent dominating sets in the strong product of paths and cycles Antoaneta...
In this paper we explore graphs having same domination number and independent domination number . S...
AbstractThe independence number of the strong product of cycles is considered in this paper. We desc...
AbstractLet G be a simple graph of order n. The independent domination numberi(G) is defined to be t...
Let G =(V,E) be a finite undirected graph. A set F of the edges of a graph G is an edge dominating s...
This thesis examines the domination number of the semi-strong product of two graphs G and H where bo...
A set S of vertices in a graph G is called an independent dominating set if S is both independent an...
AbstractLet G be a 2-connected graph on n vertices such that d(x) + d(y) + d(z) ⩾ n for all triples ...
A set S of vertices in a graph G is an independent dominating set of G if S is an independent set an...
AbstractAllan and Laskar have shown that K1.3-free graphs with equal domination and independent domi...
AbstractThis paper deals with the problem of determining the independence number for the strong grap...
A subset S of a vertex set V is called a dominating set of graph G if every vertex of V -S is domina...
The problems of determining the maximum cardinality of an independent set of vertices and the minimu...
AbstractLet k⩾2,n=2k+1, and let m0,…,mk−1 each be a multiple of n. The graph Cm0×⋯×Cmk−1 consists of...
[EN] A set D of vertices of a graph G is a total dominating set if every vertex of G is adjacent to ...
Independent sets and independent dominating sets in the strong product of paths and cycles Antoaneta...
In this paper we explore graphs having same domination number and independent domination number . S...
AbstractThe independence number of the strong product of cycles is considered in this paper. We desc...
AbstractLet G be a simple graph of order n. The independent domination numberi(G) is defined to be t...
Let G =(V,E) be a finite undirected graph. A set F of the edges of a graph G is an edge dominating s...
This thesis examines the domination number of the semi-strong product of two graphs G and H where bo...
A set S of vertices in a graph G is called an independent dominating set if S is both independent an...
AbstractLet G be a 2-connected graph on n vertices such that d(x) + d(y) + d(z) ⩾ n for all triples ...
A set S of vertices in a graph G is an independent dominating set of G if S is an independent set an...
AbstractAllan and Laskar have shown that K1.3-free graphs with equal domination and independent domi...
AbstractThis paper deals with the problem of determining the independence number for the strong grap...
A subset S of a vertex set V is called a dominating set of graph G if every vertex of V -S is domina...
The problems of determining the maximum cardinality of an independent set of vertices and the minimu...
AbstractLet k⩾2,n=2k+1, and let m0,…,mk−1 each be a multiple of n. The graph Cm0×⋯×Cmk−1 consists of...
[EN] A set D of vertices of a graph G is a total dominating set if every vertex of G is adjacent to ...