Výsledky vyhledávání - "Abara, Ma. Nerissa M."

Report

Maximal failed zero forcing sets for products of two graphs

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

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$ with the following color-change rule: let $S$ be the set of all initially

Externí odkaz: http://arxiv.org/abs/2202.04997

Zobrazit plný text záznamu

Report

Minimum rank and failed zero forcing number of graphs

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

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 its white vertices to become blue after a finite application of a spe

Externí odkaz: http://arxiv.org/abs/2202.04993

Zobrazit plný text záznamu

Report

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

Autor: Abara, Ma. Nerissa M., Merino, Dennis I., Rabanovich, Vyacheslav I., Sergeichuk, Vladimir V., Maria, John Patrick Sta.

Publikováno v: Linear Algebra Appl. 508 (2016) 246-254

An $n\times n$ complex matrix $A$ is called coninvolutory if $\bar AA=I_n$ and skew-coninvolutory if $\bar AA=-I_n$ (which implies that $n$ is even). We prove that each matrix of size $n\times n$ with $n>1$ is a sum of 5 coninvolutory matrices and ea

Externí odkaz: http://arxiv.org/abs/1608.02503

Zobrazit plný text záznamu