Spanning Simplicial Ccomplexes of Uni-Cyclic Graphs

Abstract

In this paper, we introduce the concept of spanning simplicial complexes s(G) associated to a simple finite connected graph G. We give the characterization of all spanning trees of the uni-cyclic graph Un,m. In particular, we give the formula for computing the Hilbert series and h-vector of the Stanley-Riesner ring k[s(Un,m)]. Finally, we prove that the spanning simplicial complex s(Un,m) is shifted hence s(Un,m) is shellable.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…