𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the number of edges in the transitive closure of a graph

✍ Scribed by W.F. McColl; K. Noshita

Publisher
Elsevier Science
Year
1986
Tongue
English
Weight
232 KB
Volume
15
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The number of edges in a subgraph of a H
The number of edges in a subgraph of a Hamming graph
✍ R. Squier; B. Torrence; A. Vogt πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 363 KB

G be a subgraph of the Cartesian product Hamming graph (Kp)r with n vertices. Then the number of edges of G is at most (1/2)(p -1) log, n, with equality holding if and only G is isomorphic to (Kp)s for some s 5 r.

The number of edges in a maximum cycleβ€”d
The number of edges in a maximum cycleβ€”distributed graph
✍ Yongbing Shi πŸ“‚ Article πŸ“… 1992 πŸ› Elsevier Science 🌐 English βš– 288 KB

Shi, Y., The number of edges in a maximum cycle-distributed graph, Discrete Mathematics 104 (1992) 205-209. Let f(n) (f\*(n)) be the maximum possible number of edges in a graph (2-connected simple graph) on n vertices in which no two cycles prove that, for every integer n > 3, f(n) 3 n + k + [i( [~(

The maximum number of edges in a minimal
The maximum number of edges in a minimal graph of diameter 2
✍ ZoltΓ‘n FΓΌredi πŸ“‚ Article πŸ“… 1992 πŸ› John Wiley and Sons 🌐 English βš– 717 KB

## Abstract A graph __g__ of diameter 2 is minimal if the deletion of any edge increases its diameter. Here the following conjecture of Murty and Simon is proved for __n__ < __n__~o~. If __g__ has __n__ vertices then it has at most __n__^2^/4 edges. The only extremum is the complete bipartite graph