
doi: 10.37236/2316
We obtain the reduced form of the “combinatorial logarithm” Ω by looking at bijections related to connected point-determining cographs and connected co-point-determining graphs.
point-determining graphs, graphical enumeration, Exact enumeration problems, generating functions, combinatorial theory of species, cographs, combinatorial logarithm, Combinatorial identities, bijective combinatorics
point-determining graphs, graphical enumeration, Exact enumeration problems, generating functions, combinatorial theory of species, cographs, combinatorial logarithm, Combinatorial identities, bijective combinatorics
| 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). | 1 | |
| 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. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
