论文信息 - Enumerating threshold graphs and some related graph classes

Enumerating threshold graphs and some related graph classes

We give combinatorial proofs of some enumeration formulas involving labelled threshold, quasi-threshold, loop-threshold and quasi-loop-threshold graphs. In each case we count by number of vertices and number of components. For threshold graphs, we also count by number of dominating vertices, and for loop-threshold graphs we count by number of looped dominating vertices.

[1] N. Mahadev,et al. Threshold graphs and related topics , 1995 .

[2] Uri N. Peled,et al. Enumeration of labelled threshold graphs and a theorem of frobenius involving eulerian polynomials , 1987, Graphs Comb..

[3] Sam Spiro. Counting labeled threshold graphs with Eulerian numbers , 2019, Australas. J Comb..

[4] P. Hammer,et al. Aggregation of inequalities in integer programming. , 1975 .

[5] Jonathan Cutler,et al. Extremal graphs for homomorphisms , 2011, J. Graph Theory.

[6] E. S. Wolk. The comparability graph of a tree , 1962 .

[7] Venkatesan Guruswami,et al. Enumerative aspects of certain subclasses of perfect graphs , 1999, Discret. Math..

[8] Martin Charles Golumbic,et al. Trivially perfect graphs , 1978, Discret. Math..

[9] Jonathan Cutler,et al. Extremal Graphs for Homomorphisms II , 2014, J. Graph Theory.

[10] Arthur T. Benjamin,et al. An Alternate Approach to Alternating Sums: A Method to DIE for , 2008 .