Clique polynomials and independent set polynomials of graphs
Author:
Publisher
Elsevier BV
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference13 articles.
1. Linear time algorithms for NP-hard problems restricted to partial k-trees;Arnborg;Discrete Appl. Math.,1989
2. Algebraic Graph Theory;Biggs,1974
3. An introduction to matching polynomials;Farrell;J. Combin. Theory Ser. B,1979
4. The number of words of length n in a free “semi abelian” monoid;Fisher;Amer. Math. Monthly,1989
5. Dependence polynomials;Fisher;Discrete Math.,1990
Cited by 124 articles. 订阅此论文施引文献 订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. An intriguing numerical strategy for Zakharov–Kuznetsov equation through graph-theoretic polynomials;Physica Scripta;2024-08-28
2. The Weak Lefschetz Property of Artinian Algebras Associated to Paths and Cycles;Acta Mathematica Vietnamica;2024-08-14
3. An efficient technique for time fractional Klein-Gordon equation based on modified Laplace Adomian decomposition technique via hybridized Newton-Raphson Scheme arises in relativistic fractional quantum mechanics;Partial Differential Equations in Applied Mathematics;2024-06
4. Identities of the multi-variate independence polynomials from heaps theory;Proceedings - Mathematical Sciences;2024-05-20
5. Independence polynomials of graphs with given cover number or dominate number;Discrete Mathematics, Algorithms and Applications;2024-05-10
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3