Jun 15, 2019 · This article studies the k -forcing number for oriented graphs, generalizing both the zero forcing number for directed graphs and the k ...

Sep 9, 2017 · Abstract:This article studies the \emph{k-forcing number} for oriented graphs, generalizing both the \emph{zero forcing number} for directed ...

This article studies the \emph{$k$-forcing number} for oriented graphs, generalizing both the \emph{zero forcing number} for directed graphs and the ...

Extremal k-forcing sets in oriented graphs · Y. Caro, Randy Davila, R. Pepper · Published in Discrete Applied Mathematics 9 September 2017 · Mathematics.

This article studies the k-forcing number for oriented graphs, generalizing both the zero forcing number for directed graphs and the k-forcing number for ...

The anti-forcing number of $G$ is the smallest number of edges such that the remaining graph obtained by deleting these edges has a unique perfect matching and ...

The maximum oriented $k$-forcing number of a simple graph $G$, written $\MOF_k(G)$, is the maximum directed $k$-forcing number among all orientations of $G$.

Aug 31, 2024 · We prove a characterization result for MAG-extremal graphs which identifies the properties of a vertex which is always in every MAG-set of the ...

Extremal k-forcing sets in oriented graphs. Y Caro, R Davila, R Pepper. Discrete Applied Mathematics 262, 42-55, 2019. 6, 2019. 현재 시스템이 작동되지 않습니다 ...

The maximum oriented $k$-forcing number of a simple graph $G$, written $\MOF_k(G)$, is the maximum directed $k$-forcing number among all orientations of $G$ ...