Acyclic orientations of graphs
Copyright policy )Acyclic orientations of graphs
AbstractLet G be a finite graph with p vertices and χ its chromatic polynomial. A combinatorial interpretation is given to the positive integer(−1)pχ(−λ), where λ is a positive integer, in terms of acyclic orientations of G. In particular, (−1)pχ(−1) is the number of acyclic orientations of G. An application is given to the enumeration of labeled acyclic digraphs. An algebra of full binomial type, in the sense of Doubilet-Rota-Stanley, is constructed which yields the generating functions which occur in the above context.
- University of California United States
- University of California, Berkeley United States
- University of California United States
- University of California, Los Angeles United States
- University of California United States
Coloring of graphs and hypergraphs, Directed graphs (digraphs), tournaments, Discrete Mathematics and Combinatorics, Enumeration in graph theory, Theoretical Computer Science
Coloring of graphs and hypergraphs, Directed graphs (digraphs), tournaments, Discrete Mathematics and Combinatorics, Enumeration in graph theory, Theoretical Computer Science
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).261 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Top 1% influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 0.1% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!