Ma. Nerissa M. Abara

most citedEach n-by-n matrix with n>1 is a sum of 5 coninvolutory matrices

3 citations · 3 across the 3 of their papers we have counts for

collaborators

3 papers

math.CO2022

Maximal failed zero forcing sets for products of two graphs

Ma. Nerissa M. Abara, Prince Allan B. Pelayo

Let $G$ be a simple, finite graph with vertex set $V (G)$ and edge set $E (G)$ , where each vertex is either colored blue or white. Define the standard zero forcing process on $G$ wit…

math.CO2022

Minimum rank and failed zero forcing number of graphs

Ma. Nerissa M. Abara, Prince Allan B. Pelayo

Let $G$ be a simple, finite, and undirected graph with vertices each given an initial coloring of either blue or white. Zero forcing on graph $G$ is an iterative process of forcing…

math.RA2016★ 3 cited

Each n-by-n matrix with n>1 is a sum of 5 coninvolutory matrices

Ma. Nerissa M. Abara, Dennis I. Merino, Vyacheslav I. Rabanovich +2

An $n \times n$ complex matrix $A$ is called coninvolutory if $A ˉ A = I_{n}$ and skew-coninvolutory if $A ˉ A = - I_{n}$ (which implies that $n$ is even). We prove that each matrix of s…