𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On balanced signed graphs and consistent marked graphs

✍ Scribed by Fred S. Roberts

Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
560 KB
Volume
2
Category
Article
ISSN
1571-0653

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Balancing signed graphs
Balancing signed graphs
✍ J. Akiyama; D. Avis; V. ChvΓ‘tal; H. Era πŸ“‚ Article πŸ“… 1981 πŸ› Elsevier Science 🌐 English βš– 416 KB
A characterization of consistent marked
A characterization of consistent marked graphs
✍ Cornelis Hoede πŸ“‚ Article πŸ“… 1992 πŸ› John Wiley and Sons 🌐 English βš– 364 KB

## Abstract A marked graph is obtained from a graph by giving each point either a positive or a negative sign. Beineke and Harary raised the problem of characterzing consistent marked graphs in which the product of the signs of the points is positive for every cycle. In this paper a characterizatio

On signed graphs and gramians
On signed graphs and gramians
✍ A. J. Hoffman πŸ“‚ Article πŸ“… 1977 πŸ› Springer 🌐 English βš– 580 KB
Balance in stochastic signed graphs
Balance in stochastic signed graphs
✍ Ove Frank; Frank Harary πŸ“‚ Article πŸ“… 1979 πŸ› Elsevier Science 🌐 English βš– 484 KB
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