𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The Spectra of Complementary Subgraphs in a Strongly Regular Graph

✍ Scribed by D. de Caen

Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
117 KB
Volume
19
Category
Article
ISSN
0195-6698

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The minimum number of subgraphs in a gra
The minimum number of subgraphs in a graph and its complement
✍ Lane Clark πŸ“‚ Article πŸ“… 1992 πŸ› John Wiley and Sons 🌐 English βš– 265 KB πŸ‘ 2 views

## Abstract For a graphb __F__ without isolated vertices, let __M__(__F__; __n__) denote the minimum number of monochromatic copies of __F__ in any 2‐coloring of the edges of __K__~__n__~. Burr and Rosta conjectured that when __F__ has order __t__, size __u__, and __a__ automorphisms. Independent

Forbidden subgraphs and hamiitonian prop
Forbidden subgraphs and hamiitonian properties in the square of a connected graph
✍ Ronald J. Gould; Michael S. Jacobson πŸ“‚ Article πŸ“… 1984 πŸ› John Wiley and Sons 🌐 English βš– 331 KB πŸ‘ 1 views

Various Hamiltonian-like properties are investigated in the squares of connected graphs free of some set of forbidden subgraphs. The star K,+ the subdivision graph of &, and the subdivision graph of K1,3 minus an endvertex play central roles. In particular, we show that connected graphs free of the

On the Density of Subgraphs in a Graph w
On the Density of Subgraphs in a Graph with Bounded Independence Number
✍ Pavel Valtr πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 260 KB

Let \_(n, m, k) be the largest number \_ # [0, 1] such that any graph on n vertices with independence number at most m has a subgraph on k vertices with at lest \_ } ( k 2 ) edges. Up to a constant multiplicative factor, we determine \_(n, m, k) for all n, m, k. For log n m=k n, our result gives \_(