The paired dominating set D of graph G is the subset of vertex set of graph G such that the subset D is dominating set and the subgraph induced by D contains perfect Matching. The paired domination number is the minimum ...

The eigenvalue of a graph G is the eigenvalue of its adjacency matrix and the energy E(G) of graph G is the sum of absolute values of its eigenvalues. Two non-isomorphic graphs G1 and G2 of the same order are said to be ...

The concept of graph energy is a frontier between two important branches of basic sciences: namely, Mathematics and Chemistry. The sum of absolute values of eigenvalues of adjacency matrix of graph is called the energy ...

The graphs whose energy is same as that of complete graphs are known as borderenergetic graphs. We propose a procedure for the construction of borderenergetic graphs and investigate three sequences of borderenergetic graphs.

The eigenvalue of a graph G is the eigenvalue of its adjacency matrix and the energy E(G) is the sum of absolute values of eigenvalues of graph G. Two non-isomorphic graphs G1 and G2 of the same order are said to be ...

According to the research paper on Perfect Dominating Sets by Marilynn Livingston and Quentin F. Stout[1]they have been constructed the PDSs in families of graphs arising from the interconnected networks of parallel computers ...

In this paper we can try to find a relationship between two different disciplines as theory of domination and operation research. In that concern we can try to make, a domination model for linear programming problem ...

In this paper we are trying to find that the domination number of any graph is obtain by using familiar method as vertex domination techniques and edge domination techniques but from the both who one is faster than ...

The product cordial labeling is a variant of cordial labeling. Here we investigate product cordial labeling for alternate triangular snake and alternate quadrilateral snake graphs

An even mean labeling is a variant of mean labeling. Here we investigate even mean labeling for path and bistar related graphs.