Metric Dimension and Zero Forcing Number of Two Families of Line Graphs

zbMath1340.05057arXiv1207.6127MaRDI QIDQ2940613

Eunjeong Yi, Cong X. Kang, Linda Eroh

Publication date: 27 January 2015

Full work available at URL: https://arxiv.org/abs/1207.6127

zbMATH Keywords

line graphresolving setmetric dimensionwheel graphzero forcing numberzero forcing setbouquet of circles

Mathematics Subject Classification ID

Trees (05C05) Paths and cycles (05C38) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12) Eulerian and Hamiltonian graphs (05C45) Graph operations (line graphs, products, etc.) (05C76)

Related Items (18)

Unnamed Item ⋮ Computational approaches for zero forcing and related problems ⋮ Edge version of metric dimension and doubly resolving sets of the necklace graph ⋮ Proof of a conjecture on the zero forcing number of a graph ⋮ The fractional \(k\)-truncated metric dimension of graphs ⋮ On strong metric dimension of graphs and their complements ⋮ Truncated metric dimension for finite graphs ⋮ On the edge dimension and the fractional edge dimension of graphs ⋮ Infection in hypergraphs ⋮ Upper bounds on the \(k\)-forcing number of a graph ⋮ Forcing brushes ⋮ Bounds on the connected forcing number of a graph ⋮ Brushing number and zero-forcing number of graphs and their line graphs ⋮ Complexity and computation of connected zero forcing ⋮ Unnamed Item ⋮ On the zero forcing number of a graph involving some classical parameters ⋮ Edge version of metric dimension for the families of grid graphs and generalized prism graphs ⋮ Zero forcing number of a graph in terms of the number of pendant vertices

This page was built for publication: Metric Dimension and Zero Forcing Number of Two Families of Line Graphs