✦ LIBER ✦

Enumeration of packed graphs

✍ Scribed by Iwao Sato

Publisher: Elsevier Science
Year: 1990
Tongue: English
Weight: 181 KB
Volume: 82
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(90)90211-y

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Enumeration of generalized graphs

✍ N.G de Bruijn; D.A Klarner 📂 Article 📅 1969 🏛 Elsevier Science ⚖ 546 KB

Clique graphs of packed graphs

✍ Iwao Sato 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 129 KB

Let IGI be the number of vertices of a graph G and to(G) be the density of G. We call a graph G packed if the clique graph K(G) of G has exactly 2 IGI-O'(G) cliques. We correct the characterization of clique graphs of packed graphs given in Theorem 3.2 of Hedman [3]. All graphs considered here are f

Asymptotic enumeration of full graphs

✍ D. J. Kleitman; F. R. Lasaga; L. J. Cowen 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 539 KB

## Abstract A __full graph__ on __n__ vertices, as defined by Fulkerson, is a representation of the intersection and containment relations among a system of __n__ sets. It has an undirected edge between vertices representing intersecting sets, and a directed edge from __a__ to __b__ if the correspo

Enumeration of connected invariant graph

Enumeration of connected invariant graphs

✍ Edward A Bender; E.Rodney Canfield 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 455 KB

Enumeration of connected graph coverings

✍ Kwak, Jin Ho; Lee, Jaeun 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 207 KB 👁 1 views

The number of the isomorphism classes of n-fold coverings of a graph G is enumerated by the authors (Canad.

Enumeration of graphs by degree sequence

✍ Phil Hanlon 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 173 KB