The following pages link to Connected Resolvability of Graphs (Q3366608):
Displaying 14 items.
- Computing the metric dimension of graphs by genetic algorithms (Q849088) (← links)
- On the number of resolving pairs in graphs (Q897274) (← links)
- Resolvability and the upper dimension of graphs (Q1569967) (← links)
- Conditional resolvability in graphs: a survey (Q1777664) (← links)
- Local Distance Pattern Distinguishing Sets in Graphs (Q3296834) (← links)
- Connected resolving decompositions in graphs (Q4429225) (← links)
- Resolving domination in graphs (Q4802814) (← links)
- Total resolving number of edge cycle graphs (Q4956188) (← links)
- Certain Varieties of Resolving Sets of A Graph (Q5009133) (← links)
- Some family of distance pattern distinguishing graphs and realization results (Q5034560) (← links)
- Structural characterization of some family of local distance pattern distinguishing graphs (Q5059599) (← links)
- TOTAL RESOLVING NUMBER OF CORONA OF GRAPHS AND COMPLETE GRAPHS (Q5075605) (← links)
- Bounds on the connected local dimension of graphs in terms of the marked dimension and the clique number (Q5097773) (← links)
- On the metric determination of linear dependence graph (Q6078839) (← links)
