Stirling numbers of the first kind for graphs

MaRDI QIDQ5374239zbMATHFDO

Authors

Publication date 10 April 2018

Full work available at URL http://ajc.maths.uq.edu.au/pdf/70/ajc_v70_p253.pdf

zbMATH Keywords

permutations on graphs

Mathematics Subject Classification ID

Bell and Stirling numbers (11B73) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• scientific article; zbMATH DE number 4010561
• Cyclic and linear graph partitions and normal ordering
• Stirling numbers of forests and cycles
• Stirling numbers and periodic points
• Bell and Stirling numbers for graphs

Cites work

• Bell and Stirling numbers for graphs
• Counting rearrangements on generalized wheel graphs
• Generating functions for the number of permutations with limited displacement
• Seating rearrangements on arbitrary graphs
• Stirling numbers of forests and cycles
• Stirling numbers of the second kind and Bell numbers for graphs

Cited in

(10)

• Stirling numbers of the second kind and Bell numbers for graphs
• scientific article; zbMATH DE number 4010561 (Why is no real title available?)
• Recent developments in combinatorial aspects of normal ordering
• Stirling decomposition of graph homology in genus \(1\)
• scientific article; zbMATH DE number 5185602 (Why is no real title available?)
• Vector weighted Stirling numbers and an application in graph theory
• Primitivity and local primitivity of digraphs and nonnegative matrices
• Cyclic and linear graph partitions and normal ordering
• Ranking trees based on global centrality measures
• Factorial properties of graphs

Describes a project that uses

Uses Software

• OEIS

This page was built for publication: Stirling numbers of the first kind for graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5374239)