Mohammad Nur Paspasan - Academia.edu (original) (raw)
Uploads
Papers by Mohammad Nur Paspasan
Advances and Applications in Discrete Mathematics, 2021
pe γ is the minimum cardinality of a perfect edge dominating set of G. Moreover, any perfect edge... more pe γ is the minimum cardinality of a perfect edge dominating set of G. Moreover, any perfect edge dominating set of G with cardinality () G pe γ is referred to as a pe γset of G. In this paper, the researcher investigates the concept of the perfect edge domination in a graph and obtains some results involving the concepts of edge domination and perfect edge domination.
Applied Mathematical Sciences, 2016
In this paper, we characterize the edge dominating sets and total edge dominating sets of the joi... more In this paper, we characterize the edge dominating sets and total edge dominating sets of the join of graphs. Further, we give some bounds for the edge domination number and total edge domination number of the join of some graphs.
Applied Mathematical Sciences, 2015
Let G = (V (G), E(G)) be a connected graph. A subset D of E(G) is called a restrained total edge ... more Let G = (V (G), E(G)) be a connected graph. A subset D of E(G) is called a restrained total edge dominating set of G if every edge in E(G) is adjacent to an edge in D and every edge not in D is adjacent to another edge not in D. The restrained total edge domination number of G denoted by γ rte (G), is the minimum cardinality of a restrained total edge dominating set of G. Any restrained total edge dominating set of G with cardinality γ rte (G) is referred to as a γ rte-set of G. In this paper, we investigate the concept of restrained total edge domination in a graph and obtain some results involving the concepts of edge domination, total edge domination and restrained total edge domination.
Advances and Applications in Discrete Mathematics, 2020
Far East Journal of Mathematical Sciences (FJMS)
Advances and Applications in Discrete Mathematics
Far East Journal of Mathematical Sciences (FJMS)
Advances and Applications in Discrete Mathematics, 2021
pe γ is the minimum cardinality of a perfect edge dominating set of G. Moreover, any perfect edge... more pe γ is the minimum cardinality of a perfect edge dominating set of G. Moreover, any perfect edge dominating set of G with cardinality () G pe γ is referred to as a pe γset of G. In this paper, the researcher investigates the concept of the perfect edge domination in a graph and obtains some results involving the concepts of edge domination and perfect edge domination.
Applied Mathematical Sciences, 2016
In this paper, we characterize the edge dominating sets and total edge dominating sets of the joi... more In this paper, we characterize the edge dominating sets and total edge dominating sets of the join of graphs. Further, we give some bounds for the edge domination number and total edge domination number of the join of some graphs.
Applied Mathematical Sciences, 2015
Let G = (V (G), E(G)) be a connected graph. A subset D of E(G) is called a restrained total edge ... more Let G = (V (G), E(G)) be a connected graph. A subset D of E(G) is called a restrained total edge dominating set of G if every edge in E(G) is adjacent to an edge in D and every edge not in D is adjacent to another edge not in D. The restrained total edge domination number of G denoted by γ rte (G), is the minimum cardinality of a restrained total edge dominating set of G. Any restrained total edge dominating set of G with cardinality γ rte (G) is referred to as a γ rte-set of G. In this paper, we investigate the concept of restrained total edge domination in a graph and obtain some results involving the concepts of edge domination, total edge domination and restrained total edge domination.
Advances and Applications in Discrete Mathematics, 2020
Far East Journal of Mathematical Sciences (FJMS)
Advances and Applications in Discrete Mathematics
Far East Journal of Mathematical Sciences (FJMS)