Publications de l'Institut Mathématique, Nouvelle Série Vol. 99(113), pp. 203–209 (2016) 

VERTEX DECOMPOSABLE GRAPHN. Hajisharifi, S. YassemiYoung Researchers and Elite Club, Khomein Branch, Islamic Azad University, Khomein, Iran; School of Math., Stat. Comp. Sci., College of Science, University of Tehran, Tehran, IranAbstract: Let $G$ be a simple graph on the vertex set $V(G)$ and $S=\{x_{11},\ldots,x_{n1}\}$ a subset of $V(G)$. Let $m_1,\ldots,m_n\geq 2$ be integers and $G_1,\ldots,G_n$ connected simple graphs on the vertex sets $V(G_i)=\{x_{i1},\ldots,x_{im_i}\}$ for $i=1,\ldots,n$. The graph $G(G_1,\ldots,G_n)$ is obtained from $G$ by attaching $G_i$ to $G$ at the vertex $x_{i1}$ for $i=1,\ldots,n$. We give a characterization of $G(G_1,\ldots,G_n)$ for being vertex decomposable. This generalizes a result due to Mousivand, Seyed Fakhari, and Yassemi. Keywords: vertex decomposable; Cohen–Macaulay Classification (MSC2000): 13F55; 05E40; 05C70; 05C38 Full text of the article: (for faster download, first choose a mirror)
Electronic fulltext finalized on: 12 Apr 2016. This page was last modified: 20 Apr 2016.
© 2016 Mathematical Institute of the Serbian Academy of Science and Arts
