𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Spectra of Regular Graphs and Hypergraphs and Orthogonal Polynomials

✍ Scribed by Wen-Ch'ing Winnie Li; Patrick Solé

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
339 KB
Volume
17
Category
Article
ISSN
0195-6698

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Cohomomorphisms of graphs and hypergraph
Cohomomorphisms of graphs and hypergraphs
✍ Pavol Hell; Jaroslav Nešetřil 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 547 KB

In addition to a widely studied notion of homomorphisms of graphs and hypergraphs, [2, 5 , 6, 7, 9, 13, 141, we introduce the dual notion of cohomomorphisms. We shall concentrate on only a few aapects of these mappings, mostly with regard to intended applications, [lo, 111. Our basic motivation is t

Polynomial Factorisation and an Applicat
Polynomial Factorisation and an Application to Regular Directed Graphs
✍ Stephen D. Cohen 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 441 KB

The main theme is the distribution of polynomials of given degree which split into a product of linear factors over a finite field. The work was motivated by the following problem on regular directed graphs. Extending a notion of Chung, Katz has defined a regular directed graph based on the k-algebr

Spectra of Hypergraphs and Applications
Spectra of Hypergraphs and Applications
✍ Keqin Feng; Wen-Ch'ing Winnie Li 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 751 KB

To a regular hypergraph we attach an operator, called its adjacency matrix, and study the second largest eigenvalue as well as the overall distribution of the spectrum of this operator. Our definition and results extend naturally what is known for graphs, including the analogous threshold bound 2 -k

On splittable colorings of graphs and hy
On splittable colorings of graphs and hypergraphs
✍ Zoltán Füredi; Radhika Ramamurthi 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 109 KB

## Abstract The notion of a split coloring of a complete graph was introduced by Erdős and Gyárfás [7] as a generalization of split graphs. In this work, we offer an alternate interpretation by comparing such a coloring to the classical Ramsey coloring problem via a two‐round game played against an

Chromatic numbers of hypergraphs and cov
Chromatic numbers of hypergraphs and coverings of graphs
✍ Zevi Miller; Heinrich Müller 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 284 KB

Burr recently proved [3] that for positive integers m , , m 2 , . . , , m, and any graph G we have x(G) 5 &, if and only if G can be expressed as the edge disjoint union of subgraphs F, satisfying x(F,) 5 m,. This theorem is generalized to hypergraphs. By suitable interpretations the generalization