Spanning Simplicial Complexes of Uni-Cyclic Multigraphs
Abstract
A multigraph is a nonsimple graph which is permitted to have multiple edges, that is, edges that have the same end nodes. We introduce the concept of spanning simplicial complexes s(G) of multigraphs G, which provides a generalization of spanning simplicial complexes of associated simple graphs. We give first the characterization of all spanning trees of a uni-cyclic multigraph Un,mr with n edges including r multiple edges within and outside the cycle of length m. Then, we determine the facet ideal IF(s(Un,mr)) of spanning simplicial complex s(Un,mr) and its primary decomposition. The Euler characteristic is a well-known topological and homotopic invariant to classify surfaces. Finally, we device a formula for Euler characteristic of spanning simplicial complex s(Un,mr).
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.