Regularity in Weighted Graphs: A Symmetric Function Approach
From MaRDI portal
Publication:3120646
zbMath1406.05043arXiv1507.05121MaRDI QIDQ3120646
Publication date: 5 March 2019
Full work available at URL: https://arxiv.org/abs/1507.05121
Symmetric functions and generalizations (05E05) Enumeration in graph theory (05C30) Signed and weighted graphs (05C22)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Enumeration of bipartite graphs and bipartite blocks
- On the symmetry and asymmetry of combinatorial structures
- Symmetric functions and P-recursiveness
- Asymptotic enumeration of sparse nonnegative integer matrices with specified row and column sums
- Une combinatoire du pléthysme. (Combinatorics of plethysm)
- The diagonal of a D-finite power series is D-finite
- Une théorie combinatoire des séries formelles
- Multisets and the combinatorics of symmetric functions
- Species over a finite field
- Effective scalar products of D-finite symmetric functions
- On the non-holonomic character of logarithms, powers, and the \(n\)th prime function
- The Hammond Series of a Symmetric Function and Its Application to P-Recursiveness
- Rational and algebraic series in combinatorial enumeration
