期刊文献+
共找到1篇文章
< 1 >
每页显示 20 50 100
Solving the k-Independent Sets Problem of Graphs by Gröbner Bases
1
作者 Junyu Luo Shengzhen Ding 《Open Journal of Discrete Mathematics》 2023年第3期86-94,共9页
The aim of this paper is to given an algebraic computational method for finding maximal independent sets as well as the independent number of an arbitrary finite graph of n vertices G by strengthening the problem of f... The aim of this paper is to given an algebraic computational method for finding maximal independent sets as well as the independent number of an arbitrary finite graph of n vertices G by strengthening the problem of finding maximal independent sets of G to the problem of finding k-independent sets in G for. It is shown that the existence of k-independent sets in G is equivalent to the existence of solutions of a system of multivariate polynomial equations. It follows that the problem of finding k-independent sets can be realized by using Gröbner bases of polynomial ideals. Since the number of k-independent sets is finite, the triangular equations composed by Gröbner bases are easier to be solved. Consequently, the maximal independent sets and the independent number of G are obtained after solving at most n such equations. Finally, the numerical example is presented to illustrate the effectiveness of this algebraic computational method. 展开更多
关键词 k-independent Set Maximal Independent Set Gröbner Bases
在线阅读 下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部