𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Graphs and Balanced Simplicial Complexes

✍ Scribed by Gábor Hetyei

Publisher
Springer Japan
Year
2002
Tongue
English
Weight
273 KB
Volume
18
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On simplicial and co-simplicial vertices
On simplicial and co-simplicial vertices in graphs
✍ Chı́nh T Hoàng; Stefan Hougardy; Frédéric Maffray; N.V.R Mahadev 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 286 KB

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

Balanced graphs and noncovering graphs
Balanced graphs and noncovering graphs
✍ Oliver Pretzel; Dale Youngs 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 532 KB

Pretzel, 0. and D. Youngs, Balanced graphs and noncovering graphs, Discrete Mathematics, 88 (1991) 279-287. Probabilistic arguments show that triangle-free noncovering graphs are very common. Nevertheless, few specific examples are known. In this paper we describe a simple method of constructing a l

Strongly balanced graphs and random grap
Strongly balanced graphs and random graphs
✍ Andrzej Ruciński; Andrew Vince 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 455 KB

The concept of strongly balanced graph is introduced. It is shown that there exists a strongly balanced graph with u vertices and e edges if and only if I s u -1 s e s ( 2 " ) . This result is applied to a classic question of Erdos and Renyi: What is the probability that a random graph on n vertices

Domination-balanced graphs
Domination-balanced graphs
✍ Charles Payan; Nguyen Huy Xuong 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 355 KB

## Abstract A set __D__ of vertices in a graph is said to be a dominating set if every vertex not in __D__ is adjacent to some vertex in __D.__ The domination number β(__G__) of a graph __G__ is the size of a smallest dominating set. __G__ is called domination balanced if its vertex set can be part