Berge defined a hypergraph to be balanced if its incidence matrix is balanced. We consider this concept applied to graphs, and call a graph to be balanced when its clique matrix is balanced. Characterizations of balanced ...

We prove that, in games in which all the guards move at the same turn, the eternal domination and the clique-connected cover numbers coincide for interval graphs. A linear algorithm for the eternal dominating set problem ...

Clique-node and closed neighborhood matrices of circular interval graphs are circular matrices. The stable set polytope and the dominating set polytope on these graphs are therefore closely related to the set packing ...

New forms of colonialism in frontiers of Hispanic America: Assimilationist projects and economic disputes (Río de la Plata, late 18th century) Lía Quarleri During the colonial times, by the end of the eighteenth century, ...