On graphs maximizing the zero forcing number (Q6157420)

From MaRDI portal

Jump to:navigation, search

scientific article; zbMATH DE number 7684699

In more languages

Language	Label	Description	Also known as
English	On graphs maximizing the zero forcing number	scientific article; zbMATH DE number 7684699

Statements

scholarly article

On graphs maximizing the zero forcing number (English)

Discrete Applied Mathematics

publication date

11 May 2023

zbMATH Keywords

zero forcing set

zero forcing number

upper bound

extremal graphs

MaRDI profile type

MaRDI publication profile

Upper bounds on the \(k\)-forcing number of a graph

Zero forcing sets and the minimum rank of graphs

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

Logic circuits from zero forcing

Dynamic approach to k-forcing

A Graph Reduction Step Preserving Element-Connectivity and Applications

A lower bound on the zero forcing number

Bounds for the Zero Forcing Number of Graphs with Large Girth

On the complexity of the positive semidefinite zero forcing number

The relationship between \(k\)-forcing and \(k\)-power domination

Extremal values and bounds for the zero forcing number

Some bounds on the zero forcing number of a graph

On the zero forcing number of a graph involving some classical parameters

Proof of a conjecture on the zero forcing number of a graph

A technique for computing the zero forcing number of a graph with a cut-vertex

Zero forcing number of a graph in terms of the number of pendant vertices

Fast-mixed searching and related problems on graphs

Identifiers

zbMATH Open document ID

10.1016/j.dam.2023.03.011

Mathematics Subject Classification ID

zbMATH DE Number

Sitelinks

Mathematics(1 entry)

mardi Publication:6157420

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