Open Access. Powered by Scholars. Published by Universities.®
- Keyword
-
- Vertex coloring (2)
- Advice complexity (1)
- Aperiodic tilings (1)
- Blended learning (1)
- Chromatic number (1)
-
- Competitive analysis (1)
- Distance learning (1)
- Edge coloring (1)
- Educational video (1)
- Fraction (1)
- Frequency module (1)
- Frontier-based search (1)
- Graph measure (1)
- LTE (1)
- Linear bound (1)
- M-ary trees (1)
- Mathematical app (1)
- Middle graph (1)
- Monte Carlo method (1)
- Online algorithms (1)
- Online learning (1)
- Online search (1)
- Pancake graph (1)
- Primitive substitution tilings (1)
- Probability of relative isolation (1)
- Quasicrystals (1)
- Remote learning (1)
- STEM (1)
- Set coloring (1)
- Sigma coloring (1)
Articles 1 - 10 of 10
Full-Text Articles in Entire DC Network
Economic Losses From Covid-19 Cases In The Philippines: A Dynamic Model Of Health And Economic Policy Trade-Offs, Elvira P. De Lara-Tuprio, Ma. Regina Justina E. Estuar, Joselito T. Sescon, Cymon Kayle Lubangco, Rolly Czar Joseph T. Castillo, Timothy Robin Y. Teng, Lenard Paulo V. Tamayo, Jay Michael R. Macalalag, Gerome M. Vedeja
Economic Losses From Covid-19 Cases In The Philippines: A Dynamic Model Of Health And Economic Policy Trade-Offs, Elvira P. De Lara-Tuprio, Ma. Regina Justina E. Estuar, Joselito T. Sescon, Cymon Kayle Lubangco, Rolly Czar Joseph T. Castillo, Timothy Robin Y. Teng, Lenard Paulo V. Tamayo, Jay Michael R. Macalalag, Gerome M. Vedeja
Mathematics Faculty Publications
The COVID-19 pandemic forced governments globally to impose lockdown measures and mobility restrictions to curb the transmission of the virus. As economies slowly reopen, governments face a trade-off between implementing economic recovery and health policy measures to control the spread of the virus and to ensure it will not overwhelm the health system. We developed a mathematical model that measures the economic losses due to the spread of the disease and due to different lockdown policies. This is done by extending the subnational SEIR model to include two differential equations that capture economic losses due to COVID-19 infection and due …
Recursive Linear Bounds For The Vertex Chromatic Number Of The Pancake Graph, Aldrich Ellis C. Asuncion, Renzo Roel P. Tan, Christian Chan Shio, Kazushi Ikeda
Recursive Linear Bounds For The Vertex Chromatic Number Of The Pancake Graph, Aldrich Ellis C. Asuncion, Renzo Roel P. Tan, Christian Chan Shio, Kazushi Ikeda
Mathematics Faculty Publications
The pancake graph has been the subject of research. While studies on the various aspects of the graph are abundant, results on the chromatic properties may be further enhanced. Revolving around such context, the paper advances an alternative method to produce novel linear bounds for the vertex chromatic number of the pancake graph. The accompanying demonstration takes advantage of symmetries inherent to the graph, capturing the prefix reversal of subsequences through a homomorphism. Contained within the argument is the incorporation of known vertex chromatic numbers for certain orders of pancake graphs, rendering tighter bounds possible upon the release of new …
The Relative Isolation Probability Of A Vertex In A Multiple-Source Edge-Weighted Graph, Renzo Roel P. Tan, Kyle Stephen S. See, Jun Kawahara, Kazushi Ikeda, Richard De Jesus, Lessandro Estelito Garciano, Agnes Garciano
The Relative Isolation Probability Of A Vertex In A Multiple-Source Edge-Weighted Graph, Renzo Roel P. Tan, Kyle Stephen S. See, Jun Kawahara, Kazushi Ikeda, Richard De Jesus, Lessandro Estelito Garciano, Agnes Garciano
Mathematics Faculty Publications
Various measures that characterize graphs exist in literature. Insights into the properties of a graph as a whole and its components are revealed largely through graph measures, also called graph metrics. In seeking to interpret a consequential edge metric from a vertex-centric perspective, the paper advances an original measure – the relative isolation probability of a vertex. Concisely, the probability of relative isolation pertains to the likelihood of a vertex to be disconnected from all designated source vertices in a graph with probability-weighted edges. A two-step algorithm for efficient calculation is presented and evaluated. Contained within the procedure is a …
On The Frequency Module Of The Hull Of A Primitive Substitution Tiling, April Lynne D. Say-Awen, Dirk Frettlöh, Ma. Louise Antonette N. De Las Peñas
On The Frequency Module Of The Hull Of A Primitive Substitution Tiling, April Lynne D. Say-Awen, Dirk Frettlöh, Ma. Louise Antonette N. De Las Peñas
Mathematics Faculty Publications
Understanding the properties of tilings is of increasing relevance to the study of aperiodic tilings and tiling spaces. This work considers the statistical properties of the hull of a primitive substitution tiling, where the hull is the family of all substitution tilings with respect to the substitution. A method is presented on how to arrive at the frequency module of the hull of a primitive substitution tiling (the minimal -module, where is the set of integers) containing the absolute frequency of each of its patches. The method involves deriving the tiling's edge types and vertex stars; in the process, a …
On Twin Edge Colorings In M-Ary Trees, Jayson D. Tolentino, Reginaldo M. Marcelo, Mark Anthony C. Tolentino
On Twin Edge Colorings In M-Ary Trees, Jayson D. Tolentino, Reginaldo M. Marcelo, Mark Anthony C. Tolentino
Mathematics Faculty Publications
Let k ≥ 2 be an integer and G be a connected graph of order at least 3. A twin k-edge coloring of G is a proper edge coloring of G that uses colors from ℤk and that induces a proper vertex coloring on G where the color of a vertex v is the sum (in ℤk) of the colors of the edges incident with v. The smallest integer k for which G has a twin k-edge coloring is the twin chromatic index of G and is denoted by χ′t(G …
Deployment Of Mathematical Resources To A Philippine High School Through A Community Lte Network, Ma. Louise Antonette N. De Las Peñas, Maria Alva Q. Aberin, Agnes Garciano, Juan Carlo F. Mallari, Jumela F. Sarmiento, Mark Anthony C. Tolentino, Debbie Marie Verzosa
Deployment Of Mathematical Resources To A Philippine High School Through A Community Lte Network, Ma. Louise Antonette N. De Las Peñas, Maria Alva Q. Aberin, Agnes Garciano, Juan Carlo F. Mallari, Jumela F. Sarmiento, Mark Anthony C. Tolentino, Debbie Marie Verzosa
Mathematics Faculty Publications
In the Philippines, one challenge that continues to be faced by the Department of Education in bringing educational content in a blended learning modality is the lack of internet access of the learners. This paper discusses the distribution, through a community LTE network, of mathematical resources for Grades 7 to 10 to teachers and students of a particular high school in the Philippines. It also gives details on particular technological tools (mathematical applications) that were created to help the mathematical learning of students in a remote setting.
On The Total Set Chromatic Number Of Graphs, Mark Anthony C. Tolentino, Gerone Russel J. Eugenio, Mari-Jo P. Ruiz
On The Total Set Chromatic Number Of Graphs, Mark Anthony C. Tolentino, Gerone Russel J. Eugenio, Mari-Jo P. Ruiz
Mathematics Faculty Publications
Given a vertex coloring c of a graph, the neighborhood color set of a vertex is defined to be the set of all of its neighbors’ colors. The coloring c is called a set coloring if any two adjacent vertices have different neighborhood color sets. The set chromatic number χs(G) of a graph G is the minimum number of colors required in a set coloring of G. In this work, we investigate a total analog of set colorings, that is, we study set colorings of the total graph of graphs. Given a graph G = (V; E); its total graph …
Sigma Chromatic Numbers Of The Middle Graph Of Some Families Of Graphs, Jay-R Manamtam, Agnes Garciano, Mark Anthony C. Tolentino
Sigma Chromatic Numbers Of The Middle Graph Of Some Families Of Graphs, Jay-R Manamtam, Agnes Garciano, Mark Anthony C. Tolentino
Mathematics Faculty Publications
Let G be a nontrivial connected graph and let c : V (G) → be a vertex coloring of G, where adjacent vertices may have the same color. For a vertex υ of G, the color sum σ(υ) of υ is the sum of the colors of the vertices adjacent to υ. The coloring c is said to be a sigma coloring of G if σ(u) ≠ σ(υ) whenever u and υ are adjacent vertices in G. The minimum number of colors that can be …
Development Of An App And Videos To Support The Fraction Learning Trajectory From Grades 1-7, Debbie Marie Verzosa, Ma. Louise Antonette N. De Las Peñas, Maria Alva Q. Aberin, Agnes Garciano, Jumela F. Sarmiento, Juan Carlo F. Mallari, Mark Anthony C. Tolentino
Development Of An App And Videos To Support The Fraction Learning Trajectory From Grades 1-7, Debbie Marie Verzosa, Ma. Louise Antonette N. De Las Peñas, Maria Alva Q. Aberin, Agnes Garciano, Jumela F. Sarmiento, Juan Carlo F. Mallari, Mark Anthony C. Tolentino
Mathematics Faculty Publications
Lack of procedural fluency in fractions impedes access to advanced mathematical courses and limits opportunities for entry into STEM-related fields. This paper describes the design and pedagogical basis of the Moving Fractions app and supplementary fraction videos for promoting fraction learning. Moving Fractions utilizes game-design factors to draw students through a trajectory of fraction learning from part-whole comparisons to a more robust understanding of the measurement concept of fractions. The supplementary video immerses students in a broad range of fraction representations. The app and video are intended to form a fraction learning package for distribution in Philippine schools. Future work …
Online Algorithms With Advice For The 𝒌-Search Problem, Jhoirene B. Clemente, Henry N. Adorna, Proceso L. Fernandez Jr
Online Algorithms With Advice For The 𝒌-Search Problem, Jhoirene B. Clemente, Henry N. Adorna, Proceso L. Fernandez Jr
Department of Information Systems & Computer Science Faculty Publications
In the online search problem, a seller seeks to find the maximum price from a sequence of prices p1, p2,…, pn that is revealed in a piece-wise manner. The bound for all prices is well known in advance with m ≤ pί ≤ M. In the online k-search problem, the seller seeks to find the k maximum out of the n prices. In this paper, we present a tight bound of [Formula Presented] on the advice complexity of optimal online algorithms for online k-search. We also provide online algorithms with advice that use less than the required number of bits …