Papers by Reuella Bacalso
: Let be a simple graph. A a weakly convex dominating set of is called super weakly convex domina... more : Let be a simple graph. A a weakly convex dominating set of is called super weakly convex dominating set of if for every vertex there exists a vertexsuch thatThe minimum cardinality of a super weakly convex dominating set of denoted by is called the super weakly convex domination number of In this paper, we initiate the study of the concept and give the domination number of some special graphs. Further, we characterize the super convex dominating set in join of two graphs.
Mathematics
A new domination parameter in a fuzzy digraph is proposed to espouse a contribution in the domain... more A new domination parameter in a fuzzy digraph is proposed to espouse a contribution in the domain of domination in a fuzzy graph and a directed graph. Let GD*=V,A be a directed simple graph, where V is a finite nonempty set and A=x,y:x,y∈V,x≠y. A fuzzy digraph GD=σD,μD is a pair of two functions σD:V→0,1 and μD:A→0,1, such that μDx,y≤σDx∧σDy, where x,y∈V. An edge μDx,y of a fuzzy digraph is called an effective edge if μDx,y=σDx∧σDy. Let x,y∈V. The vertex σDx dominates σDy in GD if μDx,y is an effective edge. Let S⊆V, u∈V\S, and v∈S. A subset σDS⊆σD is a dominating set of GD if, for every σDu∈σD\σDS, there exists σDv∈σDS, such that σDv dominates σDu. The minimum dominating set of a fuzzy digraph GD is called the domination number of a fuzzy digraph and is denoted by γGD. In this paper, the concept of domination in a fuzzy digraph is introduced, the domination number of a fuzzy digraph is characterized, and the domination number of a fuzzy dipath and a fuzzy dicycle is modeled.
Journal of Engineering, 2016
This paper attempts to provide an optimum loading schedule of power generating units with the lea... more This paper attempts to provide an optimum loading schedule of power generating units with the least cost by solving a unit commitment (UC) problem and to present good estimates of cost differences when UC problem is not applied. UC is a fundamental optimization problem of power generation systems which determines the optimum schedule of generating units which minimizes generation costs. However, for small power generation firms which are situated in developing countries, UC-based problems are poorly understood if not implemented and the scheduling of generating units is based on some methodologies which may provide results that are not optimal. Thus, a case study in a small power generation firm in central Philippines is carried out to elucidate these objectives. The case requires a solution of the mixed-integer nonlinear programming (MINLP) problem. Results show that the proposed UC-based problem yields optimal costs and the cost disparity from the current scheduling scheme is appr...
Journal of Engineering, 2016
This paper attempts to provide an optimum loading schedule of power generating units with the lea... more This paper attempts to provide an optimum loading schedule of power generating units with the least cost by solving a unit commitment (UC) problem and to present good estimates of cost differences when UC problem is not applied. UC is a fundamental optimization problem of power generation systems which determines the optimum schedule of generating units which minimizes generation costs. However, for small power generation firms which are situated in developing countries, UC-based problems are poorly understood if not implemented and the scheduling of generating units is based on some methodologies which may provide results that are not optimal. Thus, a case study in a small power generation firm in central Philippines is carried out to elucidate these objectives. The case requires a solution of the mixed-integer nonlinear programming (MINLP) problem. Results show that the proposed UC-based problem yields optimal costs and the cost disparity from the current scheduling scheme is appr...
Uploads
Papers by Reuella Bacalso