Connected Resolvability of Graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4070954 (Why is no real title available?)
- scientific article; zbMATH DE number 3494441 (Why is no real title available?)
- scientific article; zbMATH DE number 3544092 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- On \(k\)-dimensional graphs and their bases
- Resolvability and the upper dimension of graphs
- Resolvability in graphs and the metric dimension of a graph
- The directed distance dimension of oriented graphs
Cited in
(27)- Resolvability and the upper dimension of graphs
- Conditional resolvability in graphs: a survey
- Results on resolvability and metric dimension in graphs
- The resolving graph of amalgamation of cycles
- scientific article; zbMATH DE number 1814846 (Why is no real title available?)
- Local distance pattern distinguishing sets in graphs
- Connected resolving decompositions in graphs
- scientific article; zbMATH DE number 1990687 (Why is no real title available?)
- scientific article; zbMATH DE number 1998282 (Why is no real title available?)
- Resolving domination in graphs
- Total resolving number of edge cycle graphs
- Certain varieties of resolving sets of a graph
- On the connected metric dimension of graphs and their complements
- Some family of distance pattern distinguishing graphs and realization results
- Structural characterization of some family of local distance pattern distinguishing graphs
- TOTAL RESOLVING NUMBER OF CORONA OF GRAPHS AND COMPLETE GRAPHS
- Bounds on the connected local dimension of graphs in terms of the marked dimension and the clique number
- On the forcing dimension of a graph
- scientific article; zbMATH DE number 2197925 (Why is no real title available?)
- On the metric determination of linear dependence graph
- Fuzzy resolving number and real basis generating fuzzy graphs
- On study of some bounds for fault-tolerant metric dimension and adjacency fault-tolerant resolving set of corona product graphs
- Weakly connected resolving sets in graphs
- A study of a combination of distance domination and resolvability in graphs
- Maximal resolving sets in a graph
- Computing the metric dimension of graphs by genetic algorithms
- On the number of resolving pairs in graphs
This page was built for publication: Connected Resolvability of Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3366608)