Positive semidefinite zero forcing numbers of two classes of graphs
Author:
Funder
esearch Grants Council of the Hong Kong Special Administrative Region, China
NSERC
Publisher
Elsevier BV
Subject
General Computer Science,Theoretical Computer Science
Reference30 articles.
1. Zero forcing sets and the minimum rank of graphs;Linear Algebra Appl.,2008
2. Parameters related to tree-width, zero forcing, and maximum nullity of a graph;Barioli;J. Graph Theory,2013
3. Zero forcing parameters and minimum rank problems;Barioli;Linear Algebra Appl.,2010
4. Minimum semidefinite rank of outerplanar graphs and the tree cover number;Barioli;Electron. J. Linear Algebra,2011
5. Bounds for minimum semidefinite rank from superpositions and cut sets;Beagley;Linear Algebra Appl.,2013
Cited by 3 articles. 订阅此论文施引文献 订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Propagation tree decompositions and linearly independent vertices;Theoretical Computer Science;2021-01
2. Blocking zero forcing processes in Cartesian products of graphs;Discrete Applied Mathematics;2020-10
3. On the zero blocking number of rectangular, cylindrical, and Möbius grids;Discrete Applied Mathematics;2020-08
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3