An edge-weighted graph , possibly with loops, is said to be antiferromagnetic if it has nonnegative weights and at most one positive eigenvalue, counting multiplicities. The number of graph homomorphisms from a graph to an antiferromagnetic graph generalises various important parameters in graph theory, including the number of independent sets and proper vertex …