✦ LIBER ✦

Distance-Balanced Graphs

✍ Scribed by Janja Jerebic; Sandi Klavžar; Douglas F. Rall

Publisher: Springer
Year: 2008
Tongue: English
Weight: 195 KB
Volume: 12
Category: Article
ISSN: 0218-0006
DOI: 10.1007/s00026-008-0337-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

On Balanced Graphs

✍ Flavia Bonomo; Guillermo Durán; Min Chih Lin; Jayme L Szwarcfiter 📂 Article 📅 2005 🏛 Springer-Verlag 🌐 English ⚖ 242 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

Orientation distance graphs

✍ Gary Chartrand; David Erwin; Michael Raines; Ping Zhang 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 194 KB

For two nonisomorphic orientations D and D H of a graph G, the orientation distance d o (D,D H ) between D and D H is the minimum number of arcs of D whose directions must be reversed to produce an orientation isomorphic to D H . The orientation distance graph h o (G) of G has the set y(G) of pairwi

Integral distance graphs

✍ Chen, Jer-Jeong; Chang, Gerard J.; Huang, Kuo-Ching 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 90 KB

Suppose D is a subset of all positive integers. The distance graph G(Z, D) with distance set D is the graph with vertex set Z, and two vertices x and y are adjacent if and only if |x -y| ∈ D. This paper studies the chromatic number χ(Z, D) of G(Z, D). In particular, we prove that χ(Z, D) ≤ |D| + 1 w