1 citations · 1 across the 7 of their papers we have counts for
Showing 2026Show all
2 papers · 1 filter
math.CO2026
The Zero Forcing Number of Graph Powers
Aida Abiad, Mary Flagg, Sina Ghasemi Nezhad +1
The -th power of a simple graph , denoted , is the graph with vertex set where two vertices are adjacent if they are within distance in . We investigate th…
cs.DM2026
Computing fixed point free automorphisms of graphs
Aida Abiad, Gabriel Coutinho, Emanuel Juliano +2
In 1981, Lubiw proved that the fixed point free automorphism problem (FPFAut) is NP-complete: given a graph G, determine whether there exists an automorphism that maps no vertex of…