Stirling numbers of the first kind for graphs

zbMATH Open1383.05249MaRDI QIDQ5374239FDOQ5374239

Authors:

Publication date: 10 April 2018

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

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

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)

Cites Work

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

Cited In (9)

• Vector weighted Stirling numbers and an application in graph theory
• Ranking trees based on global centrality measures
• Title not available (Why is that?)
• Cyclic and Linear Graph Partitions and Normal Ordering
• Recent developments in combinatorial aspects of normal ordering
• Title not available (Why is that?)
• Primitivity and Local Primitivity of Digraphs and Nonnegative Matrices
• Stirling numbers of the second kind and Bell numbers for graphs
• Factorial properties of graphs

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)