Abstract
Threshold graphs are a prevalent and widely studied class of simple graphs. We generalize this class of graphs to oriented graphs (directed simple graphs). We give generalizations to four of the most commonly used definitions and show their equivalence in the oriented case. We then enumerate the number of these oriented threshold graphs which relates to the Fibonacci numbers, and finish by finding the number of transitive orientations of threshold graphs.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 43-53 |
| Number of pages | 11 |
| Journal | Australasian Journal of Combinatorics |
| Volume | 71 |
| Issue number | 1 |
| State | Published - 2018 |
ASJC Scopus subject areas
- Discrete Mathematics and Combinatorics