Multi-color forcing in graphs (Q2657055)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Multi-color forcing in graphs	scientific article

Statements

scholarly article

0 references

Multi-color forcing in graphs (English)

0 references

Chassidy Bozeman

0 references

Pamela E. Harris

0 references

0 references

0 references

0 references

Graphs and Combinatorics

0 references

publication date

17 March 2021

0 references

full work available at URL

https://arxiv.org/abs/1912.02001

0 references

zbMATH Keywords

zero forcing

0 references

multicolor forcing

0 references

MaRDI profile type

MaRDI publication profile

0 references

Zero forcing sets and the minimum rank of graphs

0 references

Zero forcing parameters and minimum rank problems

0 references

Parameters Related to Tree‐Width, Zero Forcing, and Maximum Nullity of a Graph

0 references

Iteration Index of a Zero Forcing Set in a Graph

0 references

Irreversible \(k\)-threshold processes: Graph-theoretical threshold models of the spread of disease and of opinion

0 references

Vertex and edge spread of zero forcing number, maximum nullity, and minimum rank of a graph

0 references

Propagation time for zero forcing on a graph

0 references

On minimum rank and zero forcing sets of a graph

0 references

The Zero Forcing Number of Graphs

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/s00373-020-02201-9

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2657055

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2657055&oldid=36661990"