𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Dyad algebra and multiplication of graphs. II. Undirected graphs

✍ Scribed by Oktay Sinanoglu

Publisher
Springer
Year
1993
Tongue
English
Weight
399 KB
Volume
14
Category
Article
ISSN
0259-9791

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The undirected graph and estimates of ma
The undirected graph and estimates of matrix singular values
✍ Luoluo Li πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 385 KB

With the help of the undirected graph of a matrix we establish new theorems for estimating the singular values. The location of singular values of a matrix A is described in terms of its deleted absolute row sums and column sums. The formulation has an appearance analogous to Brauer's and Brualdi's

Quantum Simulations of Classical Random
Quantum Simulations of Classical Random Walks and Undirected Graph Connectivity
✍ John Watrous πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 160 KB

While it is straightforward to simulate a very general class of random processes space-efficiently by non-unitary quantum computations (e.g., quantum computations that allow intermediate measurements to occur), it is not currently known to what extent restricting quantum computations to be unitary a

Contractors and connectors of graph alge
Contractors and connectors of graph algebras
✍ LΓ‘szlΓ³ LovΓ‘sz; BalΓ‘zs Szegedy πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 170 KB

## Abstract We study generalizations of the β€œcontraction‐deletion” relation of the Tutte polynomial, and other similar simple operations, to other graph parameters. The question can be set in the framework of graph algebras introduced by Freedman at al [Reflection positivity, rank connectivity, and