Abstract
Let be a finite simple graph on a vertex set . Also let be integers and be connected simple graphs on the vertex sets . In this paper, we provide necessary and sufficient conditions on for which the graph obtained by attaching to is unmixed or vertex decomposable. Then we characterize Cohen--Macaulay and sequentially Cohen--Macaulay graphs obtained by attaching the cycle graphs or connected chordal graphs to an arbitrary graphs.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.