𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Graph-theoretic proof of a network theorem and some consequences

✍ Scribed by Thulasiraman, K.; Jayakumar, R.; Swamy, M.N.S.

Book ID
119814082
Publisher
IEEE
Year
1983
Tongue
English
Weight
175 KB
Volume
71
Category
Article
ISSN
0018-9219

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A GAME-THEORETIC PROOF OF ANALYTIC RAMSE
A GAME-THEORETIC PROOF OF ANALYTIC RAMSEY THEOREM
✍ Kazuyuki Tanaka πŸ“‚ Article πŸ“… 1992 πŸ› John Wiley and Sons 🌐 English βš– 217 KB

## Abstract We give a simple game‐theoretic proof of Silver's theorem that every analytic set is Ramsey. A set __P__ of subsets of Ο‰ is called Ramsey if there exists an infinite set __H__ such that either all infinite subsets of __H__ are in __P__ or all out of __P.__ Our proof clarifies a strong c

Pairing theorem of graph eigenvalues: It
Pairing theorem of graph eigenvalues: Its new proof and a generalization
✍ Mingzuo Shen πŸ“‚ Article πŸ“… 1990 πŸ› John Wiley and Sons 🌐 English βš– 148 KB

## Abstract Each undirected graph has its own adjacency matrix, which is real and symmetric. The negative of the adjacency matrix, also real and symmetric, is a well‐defined mathematically elementary concept. By this negative adjacency matrix, the negative of a graph can be defined. Then an orthogo