ON $(△,1)$-GRAPHS

Rafael Aparicio, Alexander Kelmans

Let $G=(V,E)$ be a graph and $\lambda$ a non-negative integer. A graph $G$ is called a $(\lambda ,1)$-{\em graph} if $(c0)$ $G$ is neither a complete graph no an edge-empty graph, $(c1)$…