Well-forced graphs
type: Item
instance of: scholarly article
title: Well-forced graphs
author: Cheryl Grood
author: Ruth Haas
author: Bonnie C. Jacob
author: Erika L. C. King
author: S. Nasserasr
published in: Graphs and Combinatorics
publication date: 2024-12-09T00:00:00Z
Mathematics Subject Classification ID: 05C50
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 05C69
zbMATH DE Number: 7955900
zbMATH Keywords: well-forced
zbMATH Keywords: zero forcing
zbMATH Keywords: trees
zbMATH Keywords: irrelevant vertices
MaRDI profile type: Publication
cites work: On well-dominated graphs
cites work: Zero forcing parameters and minimum rank problems
cites work: Isomorphisms and properties of TAR graphs for zero forcing and other \(X\)-set parameters
cites work: The minimum rank of symmetric matrices described by a graph: a survey
cites work: Q3797234
cites work: A characterization of well-indumatchable graphs having girth greater than seven
cites work: Zero forcing sets and the minimum rank of graphs
cites work: Q4243055
cites work: Inverse Problems and Zero Forcing for Graphs
cites work: WELL-COVERED GRAPHS: A SURVEY
DOI: 10.1007/S00373-024-02827-Z
description: scientific article; zbMATH DE number 7955900