期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
Spanning Simplicial Complex of Wheel Graph Wn
1
作者 A. Zahid M.U. Saleem +3 位作者 A. Kashif M. Khan M.A. Meraj R. Irfan 《Algebra Colloquium》 SCIE CSCD 2019年第2期309-320,共12页
In this paper, we explore the spanning simplicial complex of wheel graph Wn on vertex set [n]. Combinatorial properties of the spanning simplicial complex of wheel graph are discussed, which are then used to compute t... In this paper, we explore the spanning simplicial complex of wheel graph Wn on vertex set [n]. Combinatorial properties of the spanning simplicial complex of wheel graph are discussed, which are then used to compute the f-vector and Hilbert series of face ring k[Δs(Wn)] for the spanning simplicial complex Δs(Wn). Moreover, the associated primes of the facet ideal IF(Δs(Wn)) are also computed. 展开更多
关键词 simplicial COMPLEXES SPANNING trees SPANNING simplicial COMPLEXES f-vectors Hilbert series VERTEX COVERS
原文传递
Spanning Simplicial Complexes of Uni-Cyclic Graphs 被引量:1
2
作者 Imran Anwar Zahid Raza Agha Kashif 《Algebra Colloquium》 SCIE CSCD 2015年第4期707-710,共4页
In this paper, we introduce the concept of the spanning simplicial complex As(G) associated to a simple finite connected graph G. We characterize all spanning trees of the uni-cyclic graph Un,m. In particular, we gi... In this paper, we introduce the concept of the spanning simplicial complex As(G) associated to a simple finite connected graph G. We characterize all spanning trees of the uni-cyclic graph Un,m. In particular, we give a formula for computing the Hilbert series and h-vector of the Stanley-Reisner ring k[△s(Un,m)]. Finally, we prove that the spanning simplicial complex △s(Un,m) is shifted and hence is shellable. 展开更多
关键词 primary decomposition Hilbert series f-vector H-VECTOR spanning tree
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部