A (????,????) graph ???? is said to be a Lucas antimagic graph if there exists a bijection ????: ????(????) → {????1, ????2, ⋯????????} such that the induced injective function ????∗ ∶ ????(????) → {1,2,…∑????????} given by � �∗(????) = ∑ ????∈????(????) � �(????) are all distinct (where E(u) is the set of edges incident to u).In this paper the Lucas Antimagic Labeling of some Mirror graphs are found.