Diameter of io-decomposable Riordan graphs of the Bell type
From MaRDI portal
Publication:2062892
DOI10.1007/s00373-021-02427-1zbMath1479.05301arXiv1901.11156OpenAlexW4205840368MaRDI QIDQ2062892
Publication date: 3 January 2022
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1901.11156
Exact enumeration problems, generating functions (05A15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75) Distance in graphs (05C12)
Related Items (1)
Uses Software
Cites Work
- The group of multi-dimensional Riordan arrays
- The Riordan group
- Riordan arrays and combinatorial sums
- Neural ideals in SageMath
- More about involutions in the group of almost-Riordan arrays
- Riordan arrays, Łukasiewicz paths and Narayana polynomials
- Elements of finite order in the Riordan group and their eigenvectors
- Peakless Motzkin paths with marked level steps at fixed height
- Riordan graphs I: structural properties
- Finite and infinite dimensional Lie group structures on Riordan groups
- Riordan graphs. II: Spectral properties
- Congruences for Catalan and Motzkin numbers and related sequences
- K l+1 -Free Graphs: Asymptotic Structure and a 0-1 Law
- On Some Alternative Characterizations of Riordan Arrays
- A refined enumeration of hex trees and related polynomials
This page was built for publication: Diameter of io-decomposable Riordan graphs of the Bell type
