Complexity and computation of connected zero forcing-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Complexity and computation of connected zero forcing

Published:2017-10 Issue: Volume:229 Page:31-45
ISSN:0166-218X
Container-title:Discrete Applied Mathematics
language:en
Short-container-title:Discrete Applied Mathematics

Author:

Brimkov Boris,Hicks Illya V.

Funder

National Science Foundation

Publisher

Elsevier BV

Subject

Applied Mathematics,Discrete Mathematics and Combinatorics

Reference58 articles.

1. Hardness Results and Approximation Algorithms for Some Problems on Graphs (Ph.D. thesis);Aazami,2008

2. Zero forcing sets and the minimum rank of graphs;AIM Special Work Group;Linear Algebra Appl.,2008

3. Minimum rank of skew-symmetric matrices described by a graph;Allison;Linear Algebra Appl.,2010

4. Upper bounds on the k-forcing number of a graph;Amos;Discrete Appl. Math.,2015

5. Zero forcing parameters and minimum rank problems;Barioli;Linear Algebra Appl.,2010

Cited by 21 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On the diameter and zero forcing number of some graph classes in the Johnson, Grassmann and Hamming association scheme;Discrete Applied Mathematics;2024-05

2. Bounding the total forcing number of graphs;Journal of Combinatorial Optimization;2023-11

3. Zero forcing number for Cartesian product of some graphs;COMMUN COMB OPTIM;2023

4. On Extremal Graphs for Zero Forcing Number;Graphs and Combinatorics;2022-11-07

5. On Trees and Unicyclic Graphs with Equal Forcing-Type Numbers;Bulletin of the Malaysian Mathematical Sciences Society;2022-04-05

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP