Let G be a graph in which each edge is assigned one of the colours 1, 2,...
This paper initiates the study of fractional eternal domination in graph...
Homomorphically full graphs are those for which every homomorphic image ...
We study the relationship between the eternal domination number of a gra...
A mixed graph is, informally, an object obtained from a simple undirecte...
We show that any orientation of a graph with maximum degree three has an...
For oriented graphs G and H, a homomorphism f: G → H is
locally-injectiv...