635 citations
- Texas A&M UniversityUS6 papers
- University of Wisconsin–OshkoshUS6 papers
- Universidad Nacional Autónoma de MéxicoMX4 papers
- Centro de Investigación y de Estudios Avanzados del Instituto Politécnico NacionalMX3 papers
- Universidad de CádizES2 papers
- Yantai UniversityCN2 papers
- Benemérita Universidad Autónoma de PueblaMX1 paper
- Centro Universitário InternacionalMX1 paper
- Middle Tennessee State UniversityUS1 paper
- Monash UniversityAU1 paper
- Naval Postgraduate SchoolUS1 paper
- NED University of Engineering and TechnologyPK1 paper
20 papers · 1 filter
The fractional -truncated metric dimension of graphs
Eunjeong Yi
The metric dimension, , and the fractional metric dimension, , of a graph have been studied extensively. Let be a graph with vertex set , and let…
The distance-k dimension of graphs
Jesse Geneson, Eunjeong Yi
The metric dimension, , of a graph is a graph parameter motivated by robot navigation that has been studied extensively. Let be a graph with vertex set , and…
Distance- locating-dominating sets in graphs
Cong X. Kang, Eunjeong Yi
Let be a graph with vertex set , and let be a positive integer. A set is a \emph{distance- dominating set} of if, for each vertex , the…
The Simultaneous Fractional Dimension of Graph Families
Cong X. Kang, Iztok Peterin, Eunjeong Yi
A subset of the vertices of a connected graph resolves if no two vertices of share the same list of distances (shortest-path metric) with respect to the vertice…
On the edge dimension and fractional edge dimension of graphs
Eunjeong Yi
Let be a graph with vertex set and edge set , and let denote the length of a geodesic in . For any and , let $d(e,v)=\m…
Maker-Breaker resolving game
Cong X. Kang, Sandi Klavžar, Ismael G. Yero +1
A set of vertices of a graph is a resolving set if every vertex of is uniquely determined by its vector of distances to . In this paper, the Maker-Breaker resolving…