Pages that link to "Item:Q868391"
From MaRDI portal
The following pages link to The strong metric dimension of graphs and digraphs (Q868391):
Displaying 18 items.
- Strong Isometric Dimension, Biclique Coverings, and Sperner's Theorem (Q5295414) (← links)
- Strong metric dimension of rooted product graphs (Q5739613) (← links)
- Fault-tolerant metric dimension of two-fold heptagonal-nonagonal circular ladder (Q5866035) (← links)
- Granular computing on basic digraphs (Q5866244) (← links)
- Monitoring the edges of a graph using distances (Q5896103) (← links)
- Strong resolving partitions for strong product graphs and Cartesian product graphs (Q5962517) (← links)
- Fault-tolerant strong metric dimension of graphs (Q6059083) (← links)
- Computing the strong metric dimension for co-maximal ideal graphs of commutative rings (Q6067288) (← links)
- (Q6075963) (← links)
- Twin-free cliques in annihilator graphs of commutative rings (Q6084823) (← links)
- On weak metric dimension of digraphs (Q6132233) (← links)
- The strong metric dimension of some generalized Petersen graphs (Q6138258) (← links)
- The forcing metric dimension of a total graph of nonzero annihilating ideals (Q6147991) (← links)
- The local complement metric dimension of graphs (Q6174156) (← links)
- On the distance-edge-monitoring numbers of graphs (Q6184320) (← links)
- Strong metric dimension in annihilating-ideal graph of commutative rings (Q6602395) (← links)
- Variety of general position problems in graphs (Q6639842) (← links)
- On distance and strong metric dimension of the modular product (Q6661081) (← links)