✦ LIBER ✦

Enumeration of graphs by degree sequence

✍ Scribed by Phil Hanlon

Publisher: John Wiley and Sons
Year: 1979
Tongue: English
Weight: 173 KB
Volume: 3
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.3190030313

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Signed degree sequences of signed graphs

✍ Yan, Jing-Ho; Lih, Ko-Wei; Kuo, David; Chang, Gerard J. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 105 KB 👁 2 views

sequence to be the signed degree sequence of a signed graph or a signed tree, answering a question raised by

Degree sequences of graphs and dominance

Degree sequences of graphs and dominance order

✍ Triesch, Eberhard 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 271 KB 👁 2 views

Suppose that the graphical partition H(A) = (a: 2 . . . 2 a:) arises from A = (al 2 . . . 2 a,) by deleting the largest summand a1 from A and reducing the a1 largest of the remaining summands by one. Let (a;+l 2 . . 2 ah) = H ( A ) denote the partition obtained by applying the operator H i times. We

Signed graph factors and degree sequence

Signed graph factors and degree sequences

✍ Dean Hoffman; Heather Jordon 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 106 KB

## Abstract For a signed graph __G__ and function $f: V(G) \rightarrow Z$, a signed __f__‐factor of __G__ is a spanning subgraph __F__ such that sdeg~__F__~(__υ__) = __f__(__υ__) for every vertex __υ__ of __G__, where sdeg(__υ__) is the number of positive edges incident with __v__ less the number o

Enumeration of Cubic Graphs by Inclusion

Enumeration of Cubic Graphs by Inclusion–Exclusion

✍ William Y.C. Chen; James D. Louck 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 92 KB

We use the principle of inclusion and exclusion to enumerate labeled cubic graphs, without resort to the superposition theory of Read. This work was motivated by the cubic array representation of cubic graphs in the studies of generating functions of 3n& j coefficients in angular momentum theory.

Graph classes characterized both by forb

Graph classes characterized both by forbidden subgraphs and degree sequences

✍ Michael D. Barrus; Mohit Kumbhat; Stephen G. Hartke 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 198 KB

## Abstract Given a set ${\cal F}$ of graphs, a graph __G__ is ${\cal F}$‐free if __G__ does not contain any member of ${\cal F}$ as an induced subgraph. We say that ${\cal F}$ is a degree‐sequence‐forcing set if, for each graph __G__ in the class ${\cal C}$ of ${\cal F}$‐free graphs, every realiza

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