michael subido | University of the Philippines Diliman (original) (raw)

Papers by michael subido

Research paper thumbnail of A Correlation Study between Dengue Incidence and Climatological Factors in the Philippines

Asian Research Journal of Mathematics

Dengue is a viral mosquito-borne infection transmitted primarily by the Aedes mosquitoes. It is o... more Dengue is a viral mosquito-borne infection transmitted primarily by the Aedes mosquitoes. It is one of the several emerging tropical diseases which progressively spread geographically to virtually all tropical countries like the Philippines. Recent climate changes related to global warming have increased the potential risk of dengue outbreaks in the world. In this paper, we study and investigate temperature and precipitation as climatological factors affecting dengue incidence in the Philippines from the year 2015 to 2018. Monthly dengue cases and climate data were gathered for the said study period. A correlation and wavelet coherence analyses were performed to determine a relationship between dengue incidence and climatological factors in the Philippines. Results show that the amount of rainfall is strongly correlated to the increase of dengue cases in the country as compared to the temperature. Evidence shows that dengue incidence in the Philippines mostly occur during the rainy ...

Research paper thumbnail of The medicalisation of the women's life

What is one of the drug market’s major target? It is the illusion that the women’s needs can be d... more What is one of the drug market’s major target? It is the illusion that the women’s needs can be determined and satisfied conferring upon them the power of self-determination through choice. The present article focuses on the medicalisation of the woman’s life and the repercussions of the World Health Organisation (WHO)’s Definition of Health at the light of virtue ethics. The woman’s existence is trapped between the desire for youthfulness and search for self-identity, between the desire of living the full significance of her life and being reduced to biological functions. The woman’s medicalisation threatens her creative inclination by forcing her into a passive life. Lifestyle medicine substitutes the woman’s autonomy by commercial control. As the woman must be considered as a dynamic unity of body and spirit with natural inclincations for self-preservation and well-being the exercise of the cardinal virtues may be an answer to the challenge of medicalisation.

Research paper thumbnail of On connected closed geodetic numbers of some graphs

Applied Mathematical Sciences, 2015

This study deals primarily with the connected closed geodetic numbers of some graphs, a closed ge... more This study deals primarily with the connected closed geodetic numbers of some graphs, a closed geodetic closure invariant introduced by Buckley and Harary [2]. For S ⊆ V (G), where G is a connected graph, the geodetic closure I G [S] of S is the set of all vertices lying on some u-v geodesic where u and v are in S. In this paper, select vertices of G sequentially as follows: Select a vertex v 1 and let S 1 = {v 1 }. Select a vertex v 2 = v 1 and let S 2 = {v 1 , v 2 }, then determine I G [S 2 ]. If I G [S 2 ] = V (G), then successively select vertex v i / ∈ I G [S i−1 ] and let S i = {v 1 , v 2 , ..., v i } for i = 1, 2, ..., k. Then determine I G [S i ]. The connected closed geodetic number of a graph, denoted by ccgn(G), is defined to be the smallest k whose selection of v k in the given manner yields I G [S k ] = V (G), where S is connected. In this paper, the connected closed geodetic numbers of some graphs and the join of some connected graphs G and H were determined.

Research paper thumbnail of On connected closed geodetic number of the join of graphs

Applied Mathematical Sciences

This study deals primarily with the connected closed geodetic numbers of the join of two graphs w... more This study deals primarily with the connected closed geodetic numbers of the join of two graphs which is a modification of the closed geodetic number of graphs studied by Aniversario in [2], a geodetic closure invariant introduced by Buckley and Harary in [4]. The concept of connected closed geodetic number of a graph G, denoted by ccgn(G) is introduced and some of its properties are investigated. It is proved that, if G is a connected graph with cut-vertices and if S is a connected closed geodetic basis of G, such that w is a cut-vertex of G, then each component of G-w contains an element of S. It is shown that every cut-vertex of a connected graph G belongs to every connected closed geodetic basis of G. Some connected graphs G for which the ccgn is equal to p and 2 are characterized. In this paper, the concept of a 2-path connected closure of S in a graph G, denoted by P c 2 [S] G , is introduced. Likewise, the properties of connected closed geodetic basis of a graph G resulting from the join of connected graphs H and K for which K is a complete graph and of connected graphs H and K for which K is not a complete graph are investigated and the ccgn of G is also determined.

Research paper thumbnail of The cover pebbling number of the join of some graphs

Applied Mathematical Sciences

Given a graph G and a configuration C of pebbles on the vertices of G, a pebbling step or move [u... more Given a graph G and a configuration C of pebbles on the vertices of G, a pebbling step or move [u, v] consists of removing two pebbles off of one vertex u, and then placing one pebble on an adjacent vertex v. In a pebbling step [u, v], u is the support vertex while v is a target vertex. A graph is said to be cover-pebbled if every vertex has a pebble on it after a series of pebbling steps. The cover pebbling number γ(G) of a graph G is the minimum number of pebbles such that however the pebbles are initially placed on the vertices of G we can eventually put a pebble on every vertex simultaneously by a pebbling step. In this paper, the cover pebbling number of graphs resulting from the join of two graphs G and H are determined via a key vertex of the graph. In particular, this paper determines the cover pebbling number of the wheels W n , the fans F n , and the join of any graph G with P n and C n , respectively

Research paper thumbnail of On sequential geodetic numbers of graphs under some binary operations

Applied Mathematical Sciences, 2014

Given two vertices u and v of a connected graph G, the closed interval I G [u, v] is that set of ... more Given two vertices u and v of a connected graph G, the closed interval I G [u, v] is that set of all vertices lying in some u-v geodesic in G. If S ⊆ V (G), then I G [S] = ∪{I G [u, v] : u, v ∈ S}. Let v i ∈ V (G) for i = 1, 2, ..., n. We select vertices of G as follows: Select v 1 and let S 1 = {v 1 }. Select another vertex v 2 = v 1 and let S 2 = {v 1 , v 2 }. Then successively select vertex v k / ∈ S k−1 and let S k = S k−1 ∪ {v k } ∪ {u ∈ V (G) : u ∈ I G [v k , w] for some w ∈ S k−1 }. The sequential geodetic number of G, denoted by sgn(G) is the smallest k such that there is a sequence v 1 , v 2 , ..., v k for which S k = V (G). The set S = S k = {v 1 , v 2 ,. .. , v k } with v 1 , v 2 ,. .. , v k ∈ S k for which S k = V (G) is a sequential geodetic cover of G. The sequential geodetic number is again inspired by the achievement and avoidance games [11]. In this paper, the sequential geodetic numbers of graphs obtained from the join and corona of graphs are determined. This paper is the second part of [3]. 2 Sequential Geodetic Numbers of the Join of Graphs For the purpose of this study, the following definitions of a geodetic sequence, sequential geodetic cover and sequential geodetic basis are introduced. Definition 2.1 Let G be a connected graph. A sequence v 1 , v 2 ,. .. , v k of the vertices in G is a geodetic sequence if it generates a sequence S 1 , S 2 ,. .. , S k of subsets of V (G) satisfying the following: (1) v 1 = v 2 for which S 1 = {v 1 } and S 2 = {v 1 , v 2 }; (2) v i / ∈ S i−1 for 3 ≤ i ≤ k, with S i−1 = {v 1 , v 2 ,. .. , v i−1 } that determines v 1 , v 2 ,. .. , v k for which S i = S i−1 ∪ {v i } ∪ {u ∈ V (G) : u ∈ I G [v i , w] for some w ∈ S i−1 }.

Research paper thumbnail of On Connected Closed Geodetic Numbers of Some Graphs

This study deals primarily with the connected closed geodetic numbers of some graphs, a closed ge... more This study deals primarily with the connected closed geodetic numbers of some graphs, a closed geodetic closure invariant introduced by Buckley and Harary . For S ⊆ V (G), where G is a connected graph, the geodetic closure I G [S] of S is the set of all vertices lying on some u-v geodesic where u and v are in S. In this paper, select vertices of G sequentially as follows:

Research paper thumbnail of A Correlation Study between Dengue Incidence and Climatological Factors in the Philippines

Asian Research Journal of Mathematics

Dengue is a viral mosquito-borne infection transmitted primarily by the Aedes mosquitoes. It is o... more Dengue is a viral mosquito-borne infection transmitted primarily by the Aedes mosquitoes. It is one of the several emerging tropical diseases which progressively spread geographically to virtually all tropical countries like the Philippines. Recent climate changes related to global warming have increased the potential risk of dengue outbreaks in the world. In this paper, we study and investigate temperature and precipitation as climatological factors affecting dengue incidence in the Philippines from the year 2015 to 2018. Monthly dengue cases and climate data were gathered for the said study period. A correlation and wavelet coherence analyses were performed to determine a relationship between dengue incidence and climatological factors in the Philippines. Results show that the amount of rainfall is strongly correlated to the increase of dengue cases in the country as compared to the temperature. Evidence shows that dengue incidence in the Philippines mostly occur during the rainy ...

Research paper thumbnail of The medicalisation of the women's life

What is one of the drug market’s major target? It is the illusion that the women’s needs can be d... more What is one of the drug market’s major target? It is the illusion that the women’s needs can be determined and satisfied conferring upon them the power of self-determination through choice. The present article focuses on the medicalisation of the woman’s life and the repercussions of the World Health Organisation (WHO)’s Definition of Health at the light of virtue ethics. The woman’s existence is trapped between the desire for youthfulness and search for self-identity, between the desire of living the full significance of her life and being reduced to biological functions. The woman’s medicalisation threatens her creative inclination by forcing her into a passive life. Lifestyle medicine substitutes the woman’s autonomy by commercial control. As the woman must be considered as a dynamic unity of body and spirit with natural inclincations for self-preservation and well-being the exercise of the cardinal virtues may be an answer to the challenge of medicalisation.

Research paper thumbnail of On connected closed geodetic numbers of some graphs

Applied Mathematical Sciences, 2015

This study deals primarily with the connected closed geodetic numbers of some graphs, a closed ge... more This study deals primarily with the connected closed geodetic numbers of some graphs, a closed geodetic closure invariant introduced by Buckley and Harary [2]. For S ⊆ V (G), where G is a connected graph, the geodetic closure I G [S] of S is the set of all vertices lying on some u-v geodesic where u and v are in S. In this paper, select vertices of G sequentially as follows: Select a vertex v 1 and let S 1 = {v 1 }. Select a vertex v 2 = v 1 and let S 2 = {v 1 , v 2 }, then determine I G [S 2 ]. If I G [S 2 ] = V (G), then successively select vertex v i / ∈ I G [S i−1 ] and let S i = {v 1 , v 2 , ..., v i } for i = 1, 2, ..., k. Then determine I G [S i ]. The connected closed geodetic number of a graph, denoted by ccgn(G), is defined to be the smallest k whose selection of v k in the given manner yields I G [S k ] = V (G), where S is connected. In this paper, the connected closed geodetic numbers of some graphs and the join of some connected graphs G and H were determined.

Research paper thumbnail of On connected closed geodetic number of the join of graphs

Applied Mathematical Sciences

This study deals primarily with the connected closed geodetic numbers of the join of two graphs w... more This study deals primarily with the connected closed geodetic numbers of the join of two graphs which is a modification of the closed geodetic number of graphs studied by Aniversario in [2], a geodetic closure invariant introduced by Buckley and Harary in [4]. The concept of connected closed geodetic number of a graph G, denoted by ccgn(G) is introduced and some of its properties are investigated. It is proved that, if G is a connected graph with cut-vertices and if S is a connected closed geodetic basis of G, such that w is a cut-vertex of G, then each component of G-w contains an element of S. It is shown that every cut-vertex of a connected graph G belongs to every connected closed geodetic basis of G. Some connected graphs G for which the ccgn is equal to p and 2 are characterized. In this paper, the concept of a 2-path connected closure of S in a graph G, denoted by P c 2 [S] G , is introduced. Likewise, the properties of connected closed geodetic basis of a graph G resulting from the join of connected graphs H and K for which K is a complete graph and of connected graphs H and K for which K is not a complete graph are investigated and the ccgn of G is also determined.

Research paper thumbnail of The cover pebbling number of the join of some graphs

Applied Mathematical Sciences

Given a graph G and a configuration C of pebbles on the vertices of G, a pebbling step or move [u... more Given a graph G and a configuration C of pebbles on the vertices of G, a pebbling step or move [u, v] consists of removing two pebbles off of one vertex u, and then placing one pebble on an adjacent vertex v. In a pebbling step [u, v], u is the support vertex while v is a target vertex. A graph is said to be cover-pebbled if every vertex has a pebble on it after a series of pebbling steps. The cover pebbling number γ(G) of a graph G is the minimum number of pebbles such that however the pebbles are initially placed on the vertices of G we can eventually put a pebble on every vertex simultaneously by a pebbling step. In this paper, the cover pebbling number of graphs resulting from the join of two graphs G and H are determined via a key vertex of the graph. In particular, this paper determines the cover pebbling number of the wheels W n , the fans F n , and the join of any graph G with P n and C n , respectively

Research paper thumbnail of On sequential geodetic numbers of graphs under some binary operations

Applied Mathematical Sciences, 2014

Given two vertices u and v of a connected graph G, the closed interval I G [u, v] is that set of ... more Given two vertices u and v of a connected graph G, the closed interval I G [u, v] is that set of all vertices lying in some u-v geodesic in G. If S ⊆ V (G), then I G [S] = ∪{I G [u, v] : u, v ∈ S}. Let v i ∈ V (G) for i = 1, 2, ..., n. We select vertices of G as follows: Select v 1 and let S 1 = {v 1 }. Select another vertex v 2 = v 1 and let S 2 = {v 1 , v 2 }. Then successively select vertex v k / ∈ S k−1 and let S k = S k−1 ∪ {v k } ∪ {u ∈ V (G) : u ∈ I G [v k , w] for some w ∈ S k−1 }. The sequential geodetic number of G, denoted by sgn(G) is the smallest k such that there is a sequence v 1 , v 2 , ..., v k for which S k = V (G). The set S = S k = {v 1 , v 2 ,. .. , v k } with v 1 , v 2 ,. .. , v k ∈ S k for which S k = V (G) is a sequential geodetic cover of G. The sequential geodetic number is again inspired by the achievement and avoidance games [11]. In this paper, the sequential geodetic numbers of graphs obtained from the join and corona of graphs are determined. This paper is the second part of [3]. 2 Sequential Geodetic Numbers of the Join of Graphs For the purpose of this study, the following definitions of a geodetic sequence, sequential geodetic cover and sequential geodetic basis are introduced. Definition 2.1 Let G be a connected graph. A sequence v 1 , v 2 ,. .. , v k of the vertices in G is a geodetic sequence if it generates a sequence S 1 , S 2 ,. .. , S k of subsets of V (G) satisfying the following: (1) v 1 = v 2 for which S 1 = {v 1 } and S 2 = {v 1 , v 2 }; (2) v i / ∈ S i−1 for 3 ≤ i ≤ k, with S i−1 = {v 1 , v 2 ,. .. , v i−1 } that determines v 1 , v 2 ,. .. , v k for which S i = S i−1 ∪ {v i } ∪ {u ∈ V (G) : u ∈ I G [v i , w] for some w ∈ S i−1 }.

Research paper thumbnail of On Connected Closed Geodetic Numbers of Some Graphs

This study deals primarily with the connected closed geodetic numbers of some graphs, a closed ge... more This study deals primarily with the connected closed geodetic numbers of some graphs, a closed geodetic closure invariant introduced by Buckley and Harary . For S ⊆ V (G), where G is a connected graph, the geodetic closure I G [S] of S is the set of all vertices lying on some u-v geodesic where u and v are in S. In this paper, select vertices of G sequentially as follows: