Pages that link to "Item:Q2940613"
From MaRDI portal
The following pages link to Metric Dimension and Zero Forcing Number of Two Families of Line Graphs (Q2940613):
Displaying 21 items.
- Proof of a conjecture on the zero forcing number of a graph (Q313827) (← links)
- Upper bounds on the \(k\)-forcing number of a graph (Q479006) (← links)
- Computational approaches for zero forcing and related problems (Q1631510) (← links)
- Edge version of metric dimension and doubly resolving sets of the necklace graph (Q1634709) (← links)
- Infection in hypergraphs (Q1701092) (← links)
- Forcing brushes (Q1730262) (← links)
- Bounds on the connected forcing number of a graph (Q1756082) (← links)
- Brushing number and zero-forcing number of graphs and their line graphs (Q1756097) (← links)
- Complexity and computation of connected zero forcing (Q2012050) (← links)
- The fractional \(k\)-truncated metric dimension of graphs (Q2150580) (← links)
- Truncated metric dimension for finite graphs (Q2166223) (← links)
- On the zero forcing number of a graph involving some classical parameters (Q2292148) (← links)
- On strong metric dimension of graphs and their complements (Q2391996) (← links)
- A comparison between the metric dimension and zero forcing number of trees and unicyclic graphs (Q2403987) (← links)
- (Q2974133) (← links)
- Edge version of metric dimension for the families of grid graphs and generalized prism graphs (Q4965906) (← links)
- Zero forcing number of a graph in terms of the number of pendant vertices (Q4965925) (← links)
- (Q5090528) (← links)
- On the edge dimension and the fractional edge dimension of graphs (Q6046137) (← links)
- Edge metric dimension and mixed metric dimension of a plane graph \(T_n\) (Q6637038) (← links)
- On distance-\(s\) locating and distance-\(t\) dominating sets in graphs (Q6637048) (← links)
