Topological and Algebraic Characterizations of Gallai-Simplicial Complexes
Abstract
We recall first Gallai-simplicial complex (G) associated to Gallai graph (G) of a planar graph G. The Euler characteristic is a very useful topological and homotopic invariant to classify surfaces. In Theorems 3.2 and 3.4, we compute Euler characteristics of Gallai-simplicial complexes associated to triangular ladder and prism graphs, respectively. Let G be a finite simple graph on n vertices of the form n=3l+2 or 3l+3. In Theorem 4.4, we prove that G will be f-Gallai graph for the following types of constructions of G. Type 1. When n=3l+2. G=S4l is a graph consisting of two copies of star graphs S2l and S'2l with l≥ 2 having l common vertices. Type 2. When n=3l+3. G=S4l+1 is a graph consisting of two star graphs S2l and S2l+1 with l≥ 2 having l common vertices.
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.