scientific article; zbMATH DE number 125446
From MaRDI portal
Publication:4027145
Recommendations
Cited in
(33)- Polytopes of magic labelings of graphs and the faces of the Birkhoff polytope
- Labelings of a certain class of convex polytopes
- On magic labelings of honeycomb
- On the fault-tolerant metric dimension of convex polytopes
- Computation of the double metric dimension in convex polytopes
- On some plane graphs and their metric dimension
- Hamilton-connectedness and Hamilton-laceability of planar geometric graphs with applications
- D-magic labelings of the halved n-cube
- Fault-tolerant metric dimension of generalized wheels and convex polytopes
- Binary locating-dominating sets in rotationally-symmetric convex polytopes
- Cycle-magic graphs
- scientific article; zbMATH DE number 4208115 (Why is no real title available?)
- The Roman domination number of some special classes of graphs - convex polytopes
- scientific article; zbMATH DE number 4081585 (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 4114658 (Why is no real title available?)
- scientific article; zbMATH DE number 1885948 (Why is no real title available?)
- 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
- Rainbow and strong rainbow connection number for some families of graphs
- On topological properties of some convex polytopes by using line operator on their subdivisions
- On the metric dimension of rotationally-symmetric convex polytopes
- On families of convex polytopes with constant metric dimension
- Computation of total chromatic number for certain convex polytope graphs
- Some symmetrical planar structures with their fault-tolerant metric dimension
- The edge metric dimensions of convex polytopes
- Linear programming of monitoring the links of a fractional weighted network using distance
- The signed (total) Roman domination problem on some classes of planar graphs -- convex polytopes
- On double Roman domination problem for several graph classes
- 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 Q4027145)
