SIG-dimension conjecture proved for graphs having a perfect matching

Kumar, R; Singh, SP

Singh, SP (reprint author), Panjab Univ, Ctr Adv Study Math, Dept Math, Chandigarh, India.

DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2017; 9 (1):

Abstract

We prove the Boyer's conjecture for graphs having a perfect matching. That is, if G is such a graph of order n, then SIG(G) <= [2n/3]. We also prov......

Full Text Link


Links

期刊讨论 | 中国SCI论文 | 期刊主页 | 投稿经验 | 杂志官网 | 投稿链接 | 作者需知 | PMC链接 | Pubmed全文检索