INTERSECTION GRAPH OF A SIMPLICIAL COMPLEX

Home Page
About
Submit A Journal
Submit A Conference
Submit Paper/Book
- Submit a Preprint
- Submit a Book
Contact

International Electronic Journal of Algebra
Volume:13 Issue:13
INTERSECTION GRAPH OF A SIMPLICIAL COMPLEX

INTERSECTION GRAPH OF A SIMPLICIAL COMPLEX

Authors : M AFKHAMİ, F KHOSHAHANG

Pages : 76-90

View : 24 | Download : 13

Publication Date : 2013-06-01

Article Type : Research Paper

Abstract :In this note, firstly we introduce the intersection graph Ginsert ignore into journalissuearticles values(∆); of a simplicial complex ∆, as a graph whose vertices are all facets of ∆ and two distinct vertices are adjacent if they have non-empty intersection. We investigate some properties of this graph and simplicial complexes. Moreover, we apply this graph for finding a couple of upper and lower bounds for the vertex covering number of ∆. Also, we introduce and study the intersection ideal of a simplicial complex.
Keywords : diameter, girth, intersection graph, intersection ideal, covering number, minimal generating set, simplicial complex

ORIGINAL ARTICLE URL

VIEW PAPER (PDF)

* There may have been changes in the journal, article,conference, book, preprint etc. informations. Therefore, it would be appropriate to follow the information on the official page of the source. The information here is shared for informational purposes. IAD is not responsible for incorrect or missing information.