scientific article; zbMATH DE number 4081585
From MaRDI portal
Publication:3812263
Recommendations
Cited in
(32)- Labelings of a certain class of convex polytopes
- Computing the irregularity strength of planar graphs
- On the fault-tolerant metric dimension of convex polytopes
- On some plane graphs and their metric dimension
- Hamilton-connectedness and Hamilton-laceability of planar geometric graphs with applications
- Fault-tolerant metric dimension of generalized wheels and convex polytopes
- On the edge metric dimension of convex polytopes and its related graphs
- Binary locating-dominating sets in rotationally-symmetric convex polytopes
- The Roman domination number of some special classes of graphs - convex polytopes
- scientific article; zbMATH DE number 125446 (Why is no real title available?)
- scientific article; zbMATH DE number 1343534 (Why is no real title available?)
- Minimal doubly resolving sets and the strong metric dimension of some convex polytopes
- The binary locating-dominating number of some convex polytopes
- scientific article; zbMATH DE number 1885948 (Why is no real title available?)
- Labelling schemes for tetrahedron equations and dualities between them
- The open-locating-dominating number of some convex polytopes
- On metric dimension of P(n, 2)ʘK1 graph
- On the total irregularity strength of convex polytope graphs
- The convex and weak convex domination number of convex polytopes
- On topological properties of some convex polytopes by using line operator on their subdivisions
- On the metric dimension of rotationally-symmetric convex polytopes
- Mixed metric dimension of some plane graphs
- Fault-tolerant resolvability of some graphs of convex polytopes
- On families of convex polytopes with constant metric dimension
- Mixed metric dimension of some plane graphs
- Computation of total chromatic number for certain convex polytope graphs
- Theoretical studies of the k-strong Roman domination problem
- Some symmetrical planar structures with their fault-tolerant metric dimension
- Linear programming of monitoring the links of a fractional weighted network using distance
- On double Roman domination problem for several graph classes
- Fault-tolerant metric dimension of some plane graphs
- The nonlocal metric dimension of some convex polytopes
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3812263)
