Year: 2026
Type: article
Abstract: Let be a graph with vertex set and edge set . In graph theory, an edge resolving set is defined as a subset of vertices such that every edge in has a distinct distance representation with respect to . The minimum cardinality of an edge resolving set is called the edge metric dimension of , denoted by . This study aimed to determine the edge metric dimension of the uniform theta graph and the sunflower graph . The method employed a graph-structure approach and distance analysis between edges and vertices supported by a literature review. The results showed that for and , for , and for . Furthermore, for and , for and , for , and for .
DOI: 10.20956/t02sds33
Institution: Sunan Kalijaga State Islamic University Yogyakarta
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: diamond
OpenAlex ID: W7213471899
