15 papers
The forbidden structure for zero forcing number
Carlos A. Alfaro, Michael D. Barrus, Sergio Gerardo Gómez-Galicia +5
The {\it zero forcing number} of a graph , , is a well-studied parameter which arises from a color changing process and has strong connections to {\it minimum rank}, {\it…
Generalized Token Graphs
C. Amairani Herrera-Ramirez, Teresa I. Hoekstra-Mendoza
In this paper we give a new generalization of token graphs. Given two integers and a graph we define the generalized token graph of the graph , to be the gr…
The characterization of graphs with two trivial distance ideals
Carlos A. Alfaro, Teresa I. Hoekstra-Mendoza, Juan Pablo Serrano +1
The distance ideals of graphs are algebraic invariants that generalize the Smith normal form (SNF) and the spectrum of several distance matrices associated with a graph. In general…
Kernels in digraphs with colored vertices
Mucuy-kak Guevara, Teresa I. Hoekstra-Mendoza, Miguel Licona-Velazquez
In this paper, we introduce the concept of up-color kernel, which is a generalization of a kernel for vertex-colored digraphs. We give sufficient and necessary conditions for sever…
Bikernels by monochromatic paths
Dennis J. Diaz-Diaz, Isaías F. de-la-Fuente-Jimenez, Teresa I. Hoekstra-Mendoza +2
In this paper, we introduce the concept of bikernel by monochromatic paths of a bicolored digraph. This concept is strongly motivated by the existing notions of kernels, kernels by…
2-Segal sets from cuts of rooted trees
Julia E. Bergner, Olivia Borghi, Pinka Dey +2
The theory of 2-Segal sets has connections to various important constructions such as the Waldhausen -construction in algebraic -theory, Hall algebras, and (co)operad…