Mari-Jo P. Ruiz
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Mari-Jo P. Ruiz has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Mark Anthony Cayanan Tolentino
Ateneo de Manila University
2 shared publications - Agnes D. Garciano
Ateneo de Manila University
1 shared publication - G R J Eugenio
Department of Mathematics, School of Science and Engineering, Loyola Schools, Ateneo de Manila University, Philippines
1 shared publication - Jorge Urrutia
Instituto de Matemáticas, Universidad Nacional Autónoma de México, Mexico City, Mexico
1 shared publication - Mikio Kano
Ibaraki University
1 shared publication - Reginaldo M. Marcelo
Ateneo de Manila University
1 shared publication
Latest Publications
- Open Access
- 1 March 2021
- Published by IOP Publishing in Journal of Physics: Conference Series
- Vol. 1836 (1) , 012014
The set chromatic numbers of the middle graph of graphs
For a simple connected graphG, letc:V(G) → ℕ be a vertex coloring ofG,where adjacent vertices may be colored the same. The neighborhood color set of a vertexv, denoted byNC(v), is the set of colors of the neighbors ofv. The coloringcis called aset coloringprovided thatNC(u) ≠NC(v) for every pair of adjacent verticesuandvofG. The minimum number of colors needed for a set coloring ofGis referred to as the setchromatic numberofGand is denoted byχs(G).In this work, the set chromatic number of graphs is studied in relation to the graph operation called middle graph. Our results include the exact set chromatic numbers of the middle graph of cycles, paths, star graphs, double-star graphs, and some trees of height 2. Moreover, we establish the sharpness of some bounds on the set chromatic number of general graphs obtained using this operation. Finally, we develop an algorithm for constructing an optimal set coloring of the middle graph of trees of height 2 under some assumptions.
- 1 March 2021
- Published by IOP Publishing in Journal of Physics: Conference Series
- Vol. 1836 (1) , 012014
Open AccessThe set chromatic numbers of the middle graph of graphs
For a simple connected graphG, letc:V(G) → ℕ be a vertex coloring ofG,where adjacent vertices may be colored the same. The neighborhood color set of a vertexv, denoted byNC(v), is the set of colors of the neighbors ofv. The coloringcis called aset coloringprovided thatNC(u) ≠NC(v) for every pair of adjacent verticesuandvofG. The minimum number of colors needed for a set coloring ofGis referred to as the setchromatic numberofGand is denoted byχs(G).In this work, the set chromatic number of graphs is studied in relation to the graph operation called middle graph. Our results include the exact set chromatic numbers of the middle graph of cycles, paths, star graphs, double-star graphs, and some trees of height 2. Moreover, we establish the sharpness of some bounds on the set chromatic number of general graphs obtained using this operation. Finally, we develop an algorithm for constructing an optimal set coloring of the middle graph of trees of height 2 under some assumptions.
- Open Access
- 1 March 2021
- Published by IOP Publishing in Journal of Physics: Conference Series
- Vol. 1836 (1) , 012013
On the sigma chromatic number of the zero-divisor graphs of the ring of integers modulo n
The zero-divisor graph of a commutative ring R with unity is the graph Γ(R) whose vertex set is the set of nonzero zero divisors of R, where two vertices are adjacent if and only if their product in R is zero. A vertex coloring c : V (G) → ℕ of a non-trivial connected graph G is called a sigma coloring if σ(u) = σ(ν) for any pair of adjacent vertices u and v. Here, σ(χ) denotes the sum of the colors assigned to vertices adjacent to x. The sigma chromatic number of G, denoted by σ(G), is defined as the least number of colors needed to construct a sigma coloring of G. In this paper, we analyze the structure of the zero-divisor graph of rings ℤn, where n = pn1 1 P2 n2 …Pm nm, where m,ni,n2, …,nm are positive integers and p1,p2, …,pm are distinct primes. The analysis is carried out by partitioning the vertex set of such zero-divisor graphs and analyzing the adjacencies, cardinality, and the degree of the vertices in each set of the partition. Using these properties, we determine the sigma chromatic number of these zero-divisor graphs.
- 1 March 2021
- Published by IOP Publishing in Journal of Physics: Conference Series
- Vol. 1836 (1) , 012013
Open AccessOn the sigma chromatic number of the zero-divisor graphs of the ring of integers modulo n
The zero-divisor graph of a commutative ring R with unity is the graph Γ(R) whose vertex set is the set of nonzero zero divisors of R, where two vertices are adjacent if and only if their product in R is zero. A vertex coloring c : V (G) → ℕ of a non-trivial connected graph G is called a sigma coloring if σ(u) = σ(ν) for any pair of adjacent vertices u and v. Here, σ(χ) denotes the sum of the colors assigned to vertices adjacent to x. The sigma chromatic number of G, denoted by σ(G), is defined as the least number of colors needed to construct a sigma coloring of G. In this paper, we analyze the structure of the zero-divisor graph of rings ℤn, where n = pn1 1 P2 n2 …Pm nm, where m,ni,n2, …,nm are positive integers and p1,p2, …,pm are distinct primes. The analysis is carried out by partitioning the vertex set of such zero-divisor graphs and analyzing the adjacencies, cardinality, and the degree of the vertices in each set of the partition. Using these properties, we determine the sigma chromatic number of these zero-divisor graphs.
- 1 June 2007
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 23 (S1) , 1-39
Jin Akiyama: A Friend and His Mathematics
- 1 June 2007
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 23 (S1) , 1-39
Jin Akiyama: A Friend and His Mathematics