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

The zero forcing polynomial of a graph

  • Published:2019-04 Issue: Volume:258 Page:35-48
  • ISSN:0166-218X
  • Container-title:Discrete Applied Mathematics
  • language:en
  • Short-container-title:Discrete Applied Mathematics

Author:

Boyer Kirk,Brimkov Boris,English Sean,Ferrero Daniela,Keller Ariel,Kirsch Rachel,Phillips Michael,Reinhart Carolyn

Funder

NSF-DMS, United States

Simons Foundation Collaboration, United States

Publisher

Elsevier BV

Subject

Applied Mathematics,Discrete Mathematics and Combinatorics

Reference49 articles.

1. AIM Minimum Rank Catalog. Available at: http://admin.aimath.org/resources/graph-invariants/minimumrankoffamilies/. (Accessed: 9/21/2018).

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

3. Characterization of graphs using domination polynomials;Akbari;European J. Combin.,2010

4. On the edge cover polynomial of a graph;Akbari;European J. Combin.,2013

5. Introduction to domination polynomial of a graph;Alikhani;Ars Combin.,2014

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

1. Zero forcing with random sets;Discrete Mathematics;2024-05

2. The Zero Forcing Span of a Graph;Springer Proceedings in Mathematics & Statistics;2024

3. Isomorphisms and Properties of TAR Graphs for Zero Forcing and Other X-set Parameters;Graphs and Combinatorics;2023-07-19

4. Almost unimodal and real-rooted graph polynomials;European Journal of Combinatorics;2023-02

5. Improved Computational Approaches and Heuristics for Zero Forcing;INFORMS Journal on Computing;2021-02-09
同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3