2014
DOI: 10.24330/ieja.266243
|View full text |Cite
|
Sign up to set email alerts
|

SPANNING SIMPLICIAL COMPLEXES OF n-CYCLIC GRAPHS WITH A COMMON EDGE

Abstract: Abstract. In this paper, we characterize some algebraic and combinatorial properties of spanning simplicial complex ∆s(Gt 1 , t 2 , ··· , tn ) of the class of the n-cyclic graphs Gt 1 , t 2 , ··· , tn with a common edge. We show that ∆s(Gt 1 , t 2 , ··· , tn ) is pure simplicial complex of dimension n i=1 t i − 2n, and we also determine the Stanley-Reisner ideal I ∆s(G t 1 , t 2 , ··· , t n ) of ∆s(Gt 1 , t 2 , ··· , tn ) and its primary decomposition. Under the condition that the length of every cyclic graph … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
6
0

Year Published

2015
2015
2022
2022

Publication Types

Select...
5
2

Relationship

1
6

Authors

Journals

citations
Cited by 8 publications
(6 citation statements)
references
References 4 publications
0
6
0
Order By: Relevance
“…e theory of matroids and their broken circuit complexes is very much tied with the theory of graphs [23][24][25][26][27]. Assume that G is a simple graph on l vertices.…”
Section: Cycle Matroid and The R-cyclic Graphmentioning
confidence: 99%
“…e theory of matroids and their broken circuit complexes is very much tied with the theory of graphs [23][24][25][26][27]. Assume that G is a simple graph on l vertices.…”
Section: Cycle Matroid and The R-cyclic Graphmentioning
confidence: 99%
“…The problem of finding the SSC for a general simple finite connected graph is not an easy task to handel. Recently in [15] Zhu, Shi and Geng discussed the SSC of another class n−cyclic graphs with a common edge. In this article, we discuss some algebraic and combinatorial properties of the spanning simplicial complex ∆ s (J n,m ) of a certain class of cyclic graphs, J n,m .…”
Section: Introductionmentioning
confidence: 99%
“…, n, and x n+1 = x 1 }). Zhu et al [5] discussed some properties of the spanning simplicial complexes of the n-cyclic graphs with a common edge. In this paper,…”
Section: Introductionmentioning
confidence: 99%
“…, n, and x n+1 = x 1 }). Zhu et al [5] discussed some properties of the spanning simplicial complexes of the n-cyclic graphs with a common edge. In this paper, our goal is to characterize some algebraic and combinatorial properties of spanning simplicial complexes of some n-cyclic graphs G l1, l2, ··· , ln with a common vertex, which is obtained by joining n disjoint cycles G l1 , .…”
Section: Introductionmentioning
confidence: 99%