  An ideal I is robust if its universal Gr\"obner basis is a minimal generating
set for this ideal. In this paper, we generalize the meaning of robust ideals.
An ideal is defined as generalized robust if its universal Gr\"obner basis is
equal to its universal Markov basis. This article consists of two parts. In the
first one, we study the generalized robustness on toric ideals of a graph G. We
prove that a toric graph ideal is generalized robust if and only if its
universal Markov basis is equal to the Graver basis of the ideal. Furthermore,
we give a graph theoretical characterization of generalized robust graph
ideals, which is based on terms of graph theoretical properties of the circuits
of the graph G. In the second part, we go on to describe the general case of
toric ideals, in which we prove that a robust toric ideal has a unique minimal
system of generators, or in other words, all of its minimal generators are
indispensable.
