On the forcing dimension of a graph

MaRDI QIDQ5298595zbMATH OpenFDO

Authors Behrooz Bagheri Ghavam Abadi, Ali Zaghian

Publication date 15 December 2016

zbMATH Keywords

basis numberforcing dimensionmetric basisresolving set

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph representations (geometric and intersection representations, etc.) (05C62)

Recommendations

• scientific article; zbMATH DE number 1814846
• scientific article; zbMATH DE number 2197925
• The forcing strong metric dimension of a graph
• scientific article; zbMATH DE number 1735790
• Connected Resolvability of Graphs

Cited in

(12)

• On vertices contained in all or in no metric basis
• Finitely forcible graphons
• Extremal k-forcing sets in oriented graphs
• On tight bounds for the \(k\)-forcing number of a graph
• scientific article; zbMATH DE number 1814846 (Why is no real title available?)
• scientific article; zbMATH DE number 5139517 (Why is no real title available?)
• scientific article; zbMATH DE number 1191205 (Why is no real title available?)
• scientific article; zbMATH DE number 1735790 (Why is no real title available?)
• The forcing strong metric dimension of a graph
• Finitely forcible graphons and permutons
• Characterization theorems for the spaces of derivations of evolution algebras associated to graphs
• scientific article; zbMATH DE number 5194492 (Why is no real title available?)

This page was built for publication: On the forcing dimension of a graph

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