论文信息 - Enumeration of packed graphs

Enumeration of packed graphs

Abstract Let |G| be the number of vertices of a graph G, let ω(G) be the density of G, and K(G) be the clique graph of G. A graph G is called a (p, n)-packed graph if |G| = p, ω(G) = p− n and |K(G)| = 2n. We obtain the number of non-isomorphic (p, n)-packed graphs.

Iwao Sato

[1] Bruce Hedman,et al. Another extremal problem for Turan graphs , 1987, Discret. Math..

[2] Iwao Sato. Clique graphs of packed graphs , 1986, Discret. Math..

[3] Frank Harary,et al. On the number of bi-colored graphs. , 1958 .

[4] Bruce Hedman. The maximum number of cliques in dense graphs , 1985, Discret. Math..