1 citations · 2 across the 15 of their papers we have counts for
3 papers · 1 filter
Forts, (fractional) zero forcing, and Cartesian products of graphs
Thomas R. Cameron, Leslie Hogben, Franklin H. J. Kenter +2
The (disjoint) fort number and fractional zero forcing number are introduced and related to existing parameters including the (standard) zero forcing number. The fort hypergraph is…
Spectral Applications of Vertex-Clique Incidence Matrices Associated with a Graph
Shaun Fallat, Seyed Ahmad Mojallal
In this paper, we demonstrate a useful interaction between the theory of clique partitions, edge clique covers of a graph, and the spectra of graphs. Using a clique partition and a…
The -Analogue of Zero Forcing for Certain Families of Graphs
Shaun Fallat, Neha Joshi, Roghayeh Maleki +6
Zero forcing is a combinatorial game played on a graph with the ultimate goal of changing the colour of all the vertices at minimal cost. Originally this game was conceived as a on…