Pages that link to "Item:Q2403987"
From MaRDI portal
The following pages link to A comparison between the metric dimension and zero forcing number of trees and unicyclic graphs (Q2403987):
Displaying 18 items.
- Proof of a conjecture on the zero forcing number of a graph (Q313827) (← links)
- Mixed metric dimension of graphs with edge disjoint cycles (Q2030239) (← links)
- Note on forcing problem of trees (Q2062888) (← links)
- Local metric dimension for graphs with small clique numbers (Q2075516) (← links)
- Vertex and edge metric dimensions of unicyclic graphs (Q2127612) (← links)
- On the robustness of the metric dimension of grid graphs to adding a single edge (Q2143039) (← links)
- Vertex and edge metric dimensions of cacti (Q2166219) (← links)
- The connected metric dimension at a vertex of a graph (Q2285124) (← links)
- Bounds on the sum of domination number and metric dimension of graphs (Q4554552) (← links)
- Zero forcing number of a graph in terms of the number of pendant vertices (Q4965925) (← links)
- On the zero forcing number of generalized Sierpinski graphs (Q5135721) (← links)
- Maximum nullity and zero forcing number of graphs with rank at most 4 (Q5193233) (← links)
- Some product graphs with power dominating number at most 2 (Q5861699) (← links)
- (Q5877175) (← links)
- Getting the Lay of the Land in Discrete Space: A Survey of Metric Dimension and Its Applications (Q6071823) (← links)
- On the diameter and zero forcing number of some graph classes in the Johnson, Grassmann and Hamming association scheme (Q6124433) (← links)
- The zero forcing number of graphs with the matching number and the cyclomatic number (Q6172214) (← links)
- (Q6179673) (← links)