✦ LIBER ✦

Balance in stochastic signed graphs

✍ Scribed by Ove Frank; Frank Harary

Publisher: Elsevier Science
Year: 1979
Tongue: English
Weight: 484 KB
Volume: 2
Category: Article
ISSN: 0378-8733
DOI: 10.1016/0378-8733(79)90004-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Balancing signed graphs

✍ J. Akiyama; D. Avis; V. Chvátal; H. Era 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 416 KB

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 decompositions of a signed grap

Balanced decompositions of a signed graph

✍ Thomas Zasĺavsky 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 779 KB

Signed domination in regular graphs

✍ Odile Favaron 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 456 KB

In answer to the open questions proposed by Henning and Slater, we give sharp upper bounds on the upper signed domination number of a regular graph and on the signed domination number of a connected cubic graph. Let G = (V, E) be a simple graph. For v E V, we denote by d(u) the degree of v in V, by

Negative cycles in complete signed graph

Negative cycles in complete signed graphs

✍ Dragos Radu Popescu; Ioan Tomescu 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 449 KB

Efficient minus and signed domination in

Efficient minus and signed domination in graphs

✍ Chin Lung Lu; Sheng-Lung Peng; Chuan Yi Tang 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 399 KB

An e cient minus (respectively, signed) dominating function of a graph G = (V; E) is a function f : The e cient minus (respectively, signed) domination problem is to ÿnd an e cient minus (respectively, signed) dominating function of G. In this paper, we show that the e cient minus (respectively, si