adv

adv

发表评论

Extremal $k$-forcing sets in oriented graphs. (arXiv:1709.02988v1 [math.CO])

来源于:arXiv
This article studies the \emph{$k$-forcing number} for oriented graphs, generalizing both the \emph{zero forcing number} for directed graphs and the $k$-forcing number for simple graphs. In particular

发表评论

用户名:   登录|注册账号
标题:
评论:
使用预览按钮!检查错误!引用添加:[quote][/quote] 链接添加:[url][/url]