Abstract
Let G be a subdivision of a ladder graph. In this paper, we
study magic evaluation with type (1, 1, 1) for a given any general ladder
graph G. We prove that subdivided ladder admits magic evaluation having
type (1, 1, 1). We also prove that such a subdivision admits consecutive
magic evaluation having type (1, 1, 0).
