\(q\)-Stirling numbers of the second kind and \(q\)-Bell numbers for graphs

DOI10.1016/j.endm.2016.09.062zbMath1356.05109OpenAlexW2534143370MaRDI QIDQ510631

Michael J. Schlosser, Zsófia R. Kereskényiné Balogh

Publication date: 13 February 2017

Full work available at URL: https://doi.org/10.1016/j.endm.2016.09.062

zbMATH Keywords

\(q\)-analoguesStirling numbersBell numbers\(q\)-Stirling numbers\(q\)-Fibonacci numbers\(q\)-Bell numbersspecial numbers for graphs

Mathematics Subject Classification ID

Bell and Stirling numbers (11B73) (q)-calculus and related topics (05A30) Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (3)

Recent developments in combinatorial aspects of normal ordering ⋮ Derivation of computational formulas for certain class of finite sums: Approach to generating functions arising from p$$ p $$‐adic integrals and special functions ⋮ Fubini numbers and polynomials of graphs

Cites Work

• \(q\)-Bernoulli numbers and polynomials
• Unnamed Item
• Unnamed Item

This page was built for publication: \(q\)-Stirling numbers of the second kind and \(q\)-Bell numbers for graphs