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

MaRDI QIDQ2940613zbMATH OpenFDO

Authors Linda Eroh, Cong X. Kang, Eunjeong Yi

Publication date 27 January 2015

Full work available at URL https://arxiv.org/abs/1207.6127, http://hdl.handle.net/10338.dmlcz/143937

zbMATH Keywords

bouquet of circlesline graphmetric dimensionresolving setwheel graphzero forcing numberzero forcing set

Mathematics Subject Classification ID

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

Abstract: Zero forcing number has recently become an interesting graph parameter studied in its own right since its introduction by the "AIM Minimum Rank -- Special Graphs Work Group", whereas metric dimension is a well-known graph parameter. We investigate the metric dimension and the zero forcing number of some line graphs by first determining the metric dimension and the zero forcing number of the line graphs of wheel graphs and the bouquet of circles. We prove that $Z(G)le2Z(L(G))$ for a simple and connected graph $G$. Further, we show that $Z(G)leZ(L(G))$ when $G$ is a tree or when $G$ contains a Hamiltonian path and has a certain number of edges. We compare the metric dimension with the zero forcing number of a line graph by demonstrating a couple of inequalities between the two parameters. We end by stating some open problems.

Recommendations

• On the metric dimension of some families of graphs
• On the metric dimension of line graphs
• A comparison between the zero forcing number and the strong metric dimension of graphs
• On two families of graphs with constant metric dimension
• On the metric dimension of a zero-divisor graph
• The simultaneous metric dimension of graph families
• On adjacency metric dimension of some families of graph
• The forcing strong metric dimension of a graph
• A comparison between the metric dimension and zero forcing number of trees and unicyclic graphs
• The simultaneous strong metric dimension of graph families

Cited in

(22)

• Computational approaches for zero forcing and related problems
• Edge version of metric dimension and doubly resolving sets of the necklace graph
• Infection in hypergraphs
• 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
• The fractional \(k\)-truncated metric dimension of graphs
• Truncated metric dimension for finite graphs
• On the zero forcing number of a graph involving some classical parameters
• On strong metric dimension of graphs and their complements
• A comparison between the metric dimension and zero forcing number of trees and unicyclic graphs
• A comparison between the zero forcing number and the strong metric dimension of graphs
• A comparison on metric dimension of graphs, line graphs, and line graphs of the subdivision graphs
• Proof of a conjecture on the zero forcing number of a graph
• Upper bounds on the \(k\)-forcing number of a graph
• 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
• scientific article; zbMATH DE number 7560302 (Why is no real title available?)
• On the edge dimension and the fractional edge dimension of graphs
• Edge metric dimension and mixed metric dimension of a plane graph T_n
• On distance-s locating and distance-t dominating sets in graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2940613)