Let $Γ=(V,E)$ be a simple connected graph. $d(α,ε)=min\{d(α, w), d(α, d\}$ computes the distance between a vertex $α\in V(Γ)$ and an edge $ε=wd\in E(Γ)$. A single vertex $α$ is said to recognize (resolve) two different edges $ε_{1}$ and $ε_{2}$ from $E(Γ)$ if $d(α, ε_{2})\neq d(α, ε_{1}\}$. A subset of distinct ordered vertices $U_{E}\subseteq V(Γ)$ is said to be an edge metric generator for $Γ$ if every pair of distinct edges from $Γ$ are recognized by some element of $U_{E}$. An edge metric generator with a minimum number of elements in it, is called an edge metric basis for $Γ$. Then, the cardinality of this edge metric basis of $Γ$, is called the edge metric dimension of $Γ$, denoted by $edim(Γ)$. The concept of studying chemical structures using graph theory terminologies is both appealing and practical. It enables chemical researchers to more precisely and easily examine various chemical topologies and networks. In this article, we investigate a fascinating cluster of organic chemistry as a result of this motivation. We consider a zigzag edge coronoid fused with starphene and find its minimum vertex and edge metric generators.