Determining the edge metric dimension of the generalized Petersen graph \(P(n, 3)\)
From MaRDI portal
Publication:2125226
DOI10.1007/s10878-021-00780-8zbMath1490.05063arXiv2005.08038OpenAlexW3188040317MaRDI QIDQ2125226
Shiqiang Zhang, David G. L. Wang, Monica M. Y. Wang
Publication date: 13 April 2022
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2005.08038
Distance in graphs (05C12) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Vertices, edges, distances and metric dimension in graphs
- Enumeration of Hamiltonian cycles in certain generalized Petersen graphs
- On the power domination number of the generalized Petersen graphs
- Generalized Petersen graphs which are cycle permutation graphs
- 2-rainbow domination in generalized petersen graphs \(P(n,3)\)
- The classification of Hamiltonian generalized Petersen graphs
- A result on Hamiltonian cycles in generalized Petersen graphs
- The ubiquitous Petersen graph
- Hamiltonian cycles in generalized Petersen graphs
- A note on the generalized Petersen graphs that are also Cayley graphs
- The crossing number of \(P(N,3)\)
- Uniquely identifying the edges of a graph: the edge metric dimension
- On the reliability of generalized Petersen graphs
- On graphs with the maximum edge metric dimension
- Mixed metric dimension of graphs
- On the edge dimension of a graph
- Edge metric dimension of some graph operations
- On the minimum vertex cover of generalized Petersen graphs
- Recognizing generalized Petersen graphs in linear time
- Edge metric dimension of some generalized Petersen graphs
- On the odd girth and the circular chromatic number of generalized Petersen graphs
- On Jacobian group and complexity of the generalized Petersen graph \(\mathrm{GP}(n,k)\) through Chebyshev polynomials
- Strong edge chromatic index of the generalized Petersen graphs
- On the 2-rainbow domination in graphs
- On the domination number of the generalized Petersen graphs
- Crossing number is hard for cubic graphs
- Every generalized Petersen graph has a Tait coloring
- Which generalized petersen graphs are cayley graphs?
- A theorem on tait colorings with an application to the generalized Petersen graphs
- I-graphs and the corresponding configurations
- Self-dual configurations and regular graphs
This page was built for publication: Determining the edge metric dimension of the generalized Petersen graph \(P(n, 3)\)
