## Abstract

Consider the graph G = (V, E). It is a connected graph. It is a simple graph too. A node w ∈ V, then we call vertex, determined two elements of graph. There are vertices and edges of graphs. Any two vertices x, y ∈ E ∪ V if d(w, x) ≠ d(w, y), which d(w, x) and d(w, y) is the mixed distance of the element w (vertices or edges) in graph G. A set of vertices in a graph G is represented by the symbol R_{m} that defines a mixed metric generator for G, if the elements of vertices or edges are stipulated by several vertex set of R_{m}. There's a chance that some mixed metric generators have varied cardinality. We choose one whose the minimum cardinality and it is called the mixed metric dimension of graph G, denoted by dim_{m}(G). This research examines the mixed metric dimension of gear G_{n}, helm H_{n}, sunflower SF_{n}, and friendship graph Fr_{n}. We call these graphs by wheel-like graphs.

Original language | English |
---|---|

Article number | 012010 |

Journal | Journal of Physics: Conference Series |

Volume | 2157 |

Issue number | 1 |

DOIs | |

Publication status | Published - 17 Jan 2022 |

Event | 5th International Conference on Combinatorics, Graph Theory, and Network Topology, ICCGANT 2021 - Jember, Indonesia Duration: 21 Aug 2021 → 22 Aug 2021 |