Domination in graphs’ has been studied extensively and at present it is an emerging area of research in graph theory. An introduction and an extensive overview on domination in graphs and related topics is surveyed and detailed in the two books by Haynes et al. [1,2]. Product of graphs occurs naturally in discrete mathematics as tools in combinatorial constructions. They give rise to an importa...

Pulsed corona discharge has been found to be an effective method for the removal of trichloroethylene (TCE) from the aqueous phase. Almost complete degradation over one hour was observed irrespective of the electrolyte used in the solution. The degradation rates observed in these experiments are higher than those for other organic compounds such as phenol in pulsed corona reactors, thereby sugg...

An outer-connected dominating set for an arbitrary graph G is a set D̃ ⊆ V such that D̃ is a dominating set and the induced subgraph G[V \ D̃] be connected. In this paper, we focus on the outerconnected domination number of the product of graphs. We investigate the existence of outer-connected dominating set in lexicographic product and Corona of two arbitrary graphs, and we present upper bounds f...

In this paper we derive HF index of some graph operations containing join, Cartesian Product, Corona Product graphs and compute the Y new related to join graphs.

In the graph distance game, two players alternate in constructing a maximal path. The objective function is the distance between the two endpoints of the path, which one player tries to maximize and the other tries to minimize. In this paper we examine the distance game for various graph operations: the join, the corona and the lexicographic product of graphs. We provide general bounds and exac...

In11, Kulli and Janakiram initiate the concept of maximal domination in graphs. In this paper, we obtained some bounds characterizations. Also, estimate value number graph products such as join graphs, corona product, cartesian product strong product.

Polyamideimide coatings on magnet wire offer the best performance in chemical resistance and toughness. The thermal properties of polyamideimide coatings are also outstanding when compared to the cost of polyimide resins. Recent developments in polyamideimide resins are discussed and future trends-product offerings are also reviewed. Developments include corona resistance enamels, self-lubricat...

Let $G=(V,E)$ be a simple connected graph. A matching $M$ in a graph $G$ is a collection of edges of $G$ such that no two edges from $M$ share a vertex. A matching $M$ is maximal if it cannot be extended to a larger matching in $G$. The cardinality of any smallest maximal matching in $G$ is the saturation number of $G$ and is denoted by $s(G)$. In this paper we study the saturation numbe...