✦ LIBER ✦

Extremal graphs of diameter 4

✍ Scribed by L Caccetta

Publisher: Elsevier Science
Year: 1976
Tongue: English
Weight: 555 KB
Volume: 21
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(76)90050-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Extremal graphs of diameter at most 6 af

Extremal graphs of diameter at most 6 after deleting any vertex

✍ Yoko Usami 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 489 KB 👁 1 views

Suppose G is a graph of n vertices and diameter at most d having the property that, after deleting any vertex, the resulting subgraph has diameter at most 6. Then G contains at least max{n. r(4n -8)/31} edges if 4 s d s 6 . ## 1. Introduction We consider finite undirected simple graphs. (Terminolo

Extremal non-bipartite regular graphs of

Extremal non-bipartite regular graphs of girth 4

✍ Zhao Dong-fang 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 95 KB

Extremal graphs of diameter two and give

Extremal graphs of diameter two and given maximum degree, embeddable in a fixed surface

✍ Knor, Martin; ?ir�?, Jozef 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 137 KB 👁 2 views

It is known that for each d there exists a graph of diameter two and maximum degree d which has at least (d/2) (d + 2)/2 vertices. In contrast with this, we prove that for every surface S there is a constant d S such that each graph of diameter two and maximum degree d ≥ d S , which is embeddable in

Graphs of diameter two with no 4-circuit

Graphs of diameter two with no 4-circuits

✍ J.A. Bondy; P. Erdös; S. Fajtlowicz 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 219 KB

Extremal subgraphs of random graphs

✍ László Babai; Miklós Simonovits; Joel Spencer 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 1015 KB

## Abstract We shall prove that if __L__ is a 3‐chromatic (so called “forbidden”) graph, and —__R__^__n__^ is a random graph on __n__ vertices, whose edges are chosen independently, with probability __p__, and —__B__^__n__^ is a bipartite subgraph of __R__^__n__^ of maximum size, —__F__^__n__^ is a

Diameter vulnerability of graphs

✍ C. Peyrat 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 344 KB