We investigate the class of graphs deÿned by the property that every induced subgraph has a vertex which is either simplicial (its neighbours form a clique) or co-simplicial (its non-neighbours form an independent set). In particular we give the list of minimal forbidden subgraphs for the subclass o
✦ LIBER ✦
Simplicial powers of graphs
✍ Scribed by Andreas Brandstädt; Van Bang Le
- Book ID
- 108281543
- Publisher
- Elsevier Science
- Year
- 2009
- Tongue
- English
- Weight
- 898 KB
- Volume
- 410
- Category
- Article
- ISSN
- 0304-3975
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
On simplicial and co-simplicial vertices
✍
Chı́nh T Hoàng; Stefan Hougardy; Frédéric Maffray; N.V.R Mahadev
📂
Article
📅
2004
🏛
Elsevier Science
🌐
English
⚖ 286 KB
Strongly simplicial vertices of powers o
✍
Geir Agnarsson; Magnús M. Halldórsson
📂
Article
📅
2007
🏛
Elsevier Science
🌐
English
⚖ 148 KB
Graphs and Balanced Simplicial Complexes
✍
Gábor Hetyei
📂
Article
📅
2002
🏛
Springer Japan
🌐
English
⚖ 273 KB
Torus graphs and simplicial posets
✍
Hiroshi Maeda; Mikiya Masuda; Taras Panov
📂
Article
📅
2007
🏛
Elsevier Science
🌐
English
⚖ 278 KB
Graphs whose powers are chordal and grap
✍
Flotow, Carsten
📂
Article
📅
1997
🏛
John Wiley and Sons
🌐
English
⚖ 127 KB
👁 3 views
The main theorem of this paper gives a forbidden induced subgraph condition on G that is sufficient for chordality of G m . This theorem is a generalization of a theorem of Balakrishnan and Paulraja who had provided this only for m = 2. We also give a forbidden subgraph condition on G that is suffi
Graph embeddings and simplicial maps
✍
L. S. Heath
📂
Article
📅
1997
🏛
Springer
🌐
English
⚖ 826 KB