𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A new proof and a generalization of Ramadanov's theorem

✍ Scribed by Krantz, Steven G.

Book ID
127025185
Publisher
Taylor and Francis Group
Year
2006
Tongue
English
Weight
102 KB
Volume
51
Category
Article
ISSN
1747-6933

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A short proof for a generalization of Vi
A short proof for a generalization of Vizing's theorem
✍ Claude Berge; Jean Claude Fournier πŸ“‚ Article πŸ“… 1991 πŸ› John Wiley and Sons 🌐 English βš– 183 KB πŸ‘ 1 views

## Abstract For a simple graph of maximum degree Ξ”, it is always possible to color the edges with Ξ” + 1 colors (Vizing); furthermore, if the set of vertices of maximum degree is independent, Ξ” colors suffice (Fournier). In this article, we give a short constructive proof of an extension of these re

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