Author:
Kereskényi-Balogh Zsófia,Nyul Gábor
Abstract
AbstractIn this paper, we introduce the Fubini number and Fubini polynomial of a graph in connection with the enumeration of ordered independent partitions of its set of vertices. We prove several properties of them, and study how these notions cover other variants of Fubini numbers and polynomials for special graphs.
Publisher
Springer Science and Business Media LLC
Reference28 articles.
1. Absil, R., Camby, E., Hertz, A., Mélot, H.: A sharp lower bound on the number of non-equivalent colorings of graphs of order $$n$$ and maximum degree $$n-3$$. Discrete Appl. Math. 234, 3–11 (2018)
2. Allagan, J., Serkan, C.: Bell numbers of complete multipartite graphs. Comput. Sci. J. Moldova 24, 234–242 (2016)
3. Belbachir, H., Boutiche, M.A., Medjerredine, A.: Enumerating some stable partitions involving Stirling and $$r$$-Stirling numbers of the second kind. Mediterr. J. Math. 15,(2018). (Article 87)
4. Benoumhani, M.: On some numbers related to Whitney numbers of Dowling lattices. Adv. Appl. Math. 19, 106–116 (1997)
5. Bényi, B., Méndez, M., Ramirez, J.L.: Generalized ordered set partitions. Australas. J. Combin. 77, 157–179 (2020)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献