Spanning Simplicial Complexes of Uni-Cyclic Multigraphs

From MaRDI portal
Publication:6290272



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 Deltas(mathcalG) of multigraphs mathcalG, 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 mathcalUn,mr with n edges including r multiple edges within and outside the cycle of length m. Then, we determine the facet ideal ImathcalF(Deltas(mathcalUn,mr)) of spanning simplicial complex Deltas(mathcalUn,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 Deltas(mathcalUn,mr).














This page was built for publication: Spanning Simplicial Complexes of Uni-Cyclic Multigraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6290272)