𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The maximum number of complete subgraphs in a graph with given maximum degree

✍ Scribed by Cutler, Jonathan; Radcliffe, A.J.

Book ID
122296995
Publisher
Elsevier Science
Year
2014
Tongue
English
Weight
243 KB
Volume
104
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Sizes of graphs with induced subgraphs o
Sizes of graphs with induced subgraphs of large maximum degree
✍ Paul ErdΕ‘s; Talmage James Reid; Richard Schelp; William Staton πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 249 KB

Graphs with n + k vertices in which every set of n +j vertices induce a subgraph of maximum degree at least n are considered. For j = 1 and for k fairly small compared to n, we determine the minimum number of edges in such graphs.

The maximum interval number of graphs wi
The maximum interval number of graphs with given genus
✍ Edward R. Scheinerman πŸ“‚ Article πŸ“… 1987 πŸ› John Wiley and Sons 🌐 English βš– 202 KB πŸ‘ 1 views

The interval number of a graph G, denoted i(G), is the least positive integer t such that G is the intersection graph of sets, each of which is the union of t compact real intervals. It is known that every planar graph has interval number at most 3 and that this result is best possible. We investiga

The irredundance number and maximum degr
The irredundance number and maximum degree of a graph
✍ B. BollobΓ‘s; E.J. Cockayne πŸ“‚ Article πŸ“… 1984 πŸ› Elsevier Science 🌐 English βš– 104 KB

A vertex x in a subset X of vertices of an undirected graph is redundant if its dosed neighborhood is contained in the union of closed neighborhoods of vertices of X-{x}. In the context of a communications network, this means that any vertex that may receive communications from X may also be irdorme