✦ LIBER ✦

On Balanced Graphs

✍ Scribed by Flavia Bonomo; Guillermo Durán; Min Chih Lin; Jayme L Szwarcfiter

Publisher: Springer-Verlag
Year: 2005
Tongue: English
Weight: 242 KB
Volume: 105
Category: Article
ISSN: 0025-5610
DOI: 10.1007/s10107-005-0651-y

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On balanced signed graphs and consistent

On balanced signed graphs and consistent marked graphs

✍ Fred S. Roberts 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 560 KB

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

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

Distance-Balanced Graphs

✍ Janja Jerebic; Sandi Klavžar; Douglas F. Rall 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 195 KB

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

On balance in group graphs

✍ Frank Harary; Bernt Lindström; Hans-olov Zetterström 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 300 KB

We propose a generalization of signed graphs, called group graphs. These are graphs regarded as symmetric digraphs with a group element s(u, u ) called the signing associated with each arc (u, u ) such that s(u, u)s(u, u) = 1. A group graph is ba2anced if the product s(ul, u2)s(u2, ug) -.s(u,, ul) =