𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the connectivity of bipartite distance-balanced graphs

✍ Scribed by Štefko Miklavič; Primož Šparl

Book ID
113582430
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
248 KB
Volume
33
Category
Article
ISSN
0195-6698

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Balanced coloring of bipartite graphs
Balanced coloring of bipartite graphs
✍ Uriel Feige; Shimon Kogan 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 128 KB

## Abstract Given a bipartite graph __G__(__U__∪__V, E__) with __n__ vertices on each side, an independent set __I__∈__G__ such that |__U__∩__I__|=|__V__∩__I__| is called a balanced bipartite independent set. A balanced coloring of __G__ is a coloring of the vertices of __G__ such that each color c

On the bipartite independence number of
On the bipartite independence number of a balanced bipartite graph
✍ Odile Favaron; Pedro Mago; Oscar Ordaz 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 603 KB

Venezuela Ap. 47567, Caracas Favaron, O., P. Mago and 0. Ordaz, On the bipartite independence number of a balanced bipartite graph, Discrete Mathematics 121 (1993) 55-63. The bipartite independence number GI aIp of a bipartite graph G is the maximum order of a balanced independent set of G. Let 6 b

Connectivity of distance graphs
Connectivity of distance graphs
✍ J.D. Currie 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 243 KB

Currie, J.D., Connectivity of distance graphs, Discrete Mathematics 103 (1992) 91-94. The author shows the following: Let K 2 Q be a H-module. Let G be a graph with vertex set V, a K-space. Suppose that edges of G are preserved under translations in V. Then if G has more than one connected componen