𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Spectral criterion for cycle balance in networks

✍ Scribed by B. Devadas Acharya


Publisher
John Wiley and Sons
Year
1980
Tongue
English
Weight
452 KB
Volume
4
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

✦ Synopsis


Abstract

A network is cycle balanced if the product of the weights (nonzero real numbers) of the lines of every cycle in it is positive. In this paper, we prove that a network D is cycle balanced if and only if its adjacency matrix is isospectral with its nonnegative counterpart. Consequent to this theorem is an analogous criterion for structural balance in sigraphs (abbreviation for β€œsigned graphs”) as also for cycle balance in signed digraphs. These criteria establish in a natural way a wide scope for cospectrality considerations in the classes of signed digraphs and sigraphs.


πŸ“œ SIMILAR VOLUMES


Localized and load-balanced clustering f
✍ Yueh-Min Huang; Bey-Ling Su; Ming-Shi Wang πŸ“‚ Article πŸ“… 2008 πŸ› John Wiley and Sons 🌐 English βš– 363 KB πŸ‘ 1 views

## Abstract In this paper, the β€˜localized and load‐balanced clustering (LLBC)’ protocol is proposed for the energy savings and lifetime increases of wireless sensor networks. LLBC contains two approaches. One is improved cluster head rotation (ICHR) and the other is modified static clustering (MSC)

An efficient model development strategy
✍ H. J. L. van Can; H. A. B. te Braake; C. Hellinga; K. C. A. M. Luyben πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 335 KB πŸ‘ 2 views

In the serial gray box modeling strategy, generally available knowledge, represented in the macroscopic balance, is combined naturally with neural networks, which are powerful and convenient tools to model the inaccurately known terms in the macroscopic balance. This article shows, for a typical bio

Guidelines for Data-Parallel Cycle-Steal
✍ Arnold L. Rosenberg πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 192 KB

We derive computationally efficient guidelines for nearly optimal scheduling of data-parallel computations within a draconian mode of cycle-stealing in networks of workstations (nows). In this computing regimen, workstation A takes control of workstation B 's processor whenever it is idle, with the

Pentose phosphate cycle oxidative and no
✍ Antonio Ramos-Montoya; Wai-Nang P. Lee; Sara Bassilian; Shu Lim; Raisa V. Trebuk πŸ“‚ Article πŸ“… 2006 πŸ› John Wiley and Sons 🌐 French βš– 362 KB

## Abstract The metabolic network of cancer cells confers adaptive mechanisms against many chemotherapeutic agents, but also presents critical constraints that make the cells vulnerable to perturbation of the network due to drug therapy. To identify these fragilities, combination therapies based on

An efficient model development strategy
✍ H. J. L. van Can; H. A. B. te Braake; A. Bijman; C. Hellinga; K. Ch. A. M. Luybe πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 252 KB πŸ‘ 2 views

There is a need for efficient modeling strategies which quickly lead to reliable mathematical models that can be applied for design and optimization of (bio)chemical processes. The serial gray box modeling strategy is potentially very efficient because no detailed knowledge is needed to construct th