✦ LIBER ✦

Balanced group-labeled graphs

✍ Scribed by Manas Joglekar; Nisarg Shah; Ajit A. Diwan

Book ID: 113567456
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 221 KB
Volume: 312
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2011.09.021

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Groups of balanced labelings on graphs

✍ Cherniavsky, Yonah; Goldstein, Avraham; Levit, Vadim E. 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 425 KB

Group labelings of graphs

✍ Paul H. Edelman; Michael Saks 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 181 KB

## Abstract Given a graph Γ an abelian group __G__, and a labeling of the vertices of Γ with elements of __G__, necessary and sufficient conditions are stated for the existence of a labeling of the edges in which the label of each vertex equals the product of the labels of its incident edges. Such

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) =

Labelling Cayley Graphs on Abelian Group

Labelling Cayley Graphs on Abelian Groups

✍ Zhou, Sanming 📂 Article 📅 2005 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 233 KB

Graph labelings in elementary abelian gr

Graph labelings in elementary abelian groups

✍ Yasuhiro Fukuchi 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 392 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