Combinatorial interpretation of generalized Stirling numbers.
Lang, Wolfdieter (2009)
Journal of Integer Sequences [electronic only]
Similarity:
Displaying similar documents to “A refinement of the formula for -ary trees and the Gould-Vandermonde's convolution.”
Combinatorial interpretation of generalized Stirling numbers.
A combinatorial derivation of the number of labeled forests.
Callan, David (2003)
Journal of Integer Sequences [electronic only]
Similarity:
A combinatorial proof of Postnikov's identity and a generalized enumeration of labeled trees.
Seo, Seunghyun (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A simple bijection between binary trees and colored ternary trees.
Sun, Yidong (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Bijective proofs of identities from colored binary trees.
Yan, Sherry H.F. (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A refinement of Cayley's formula for trees.
Gessel, Ira M., Seo, Seunghyun (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On Catalan trees and the Jacobian conjecture.
Singer, Dan (2001)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Bijective counting of tree-rooted maps and shuffles of parenthesis systems.
Bernardi, Olivier (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Probabilistic proofs of hook length formulas involving trees.
Sagan, Bruce E. (2009)
Séminaire Lotharingien de Combinatoire [electronic only]
Similarity:
Noncrossing trees and noncrossing graphs.
Chen, William Y.C., Yan, Sherry H.F. (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Hook length formulas for trees by Han's expansion.
Chen, William Y.C., Gao, Oliver X.Q., Guo, Peter L. (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Determination of Large Families and Diameter of Equiseparable Trees
Zoran Stanić (2006)
Publications de l'Institut Mathématique
Similarity:
Characterization Results for theL(2, 1, 1)-Labeling Problem on Trees
Xiaoling Zhang, Kecai Deng (2017)
Discussiones Mathematicae Graph Theory
Similarity:
An L(2, 1, 1)-labeling of a graph G is an assignment of non-negative integers (labels) to the vertices of G such that adjacent vertices receive labels with difference at least 2, and vertices at distance 2 or 3 receive distinct labels. The span of such a labelling is the difference between the maximum and minimum labels used, and the minimum span over all L(2, 1, 1)-labelings of G is called the L(2, 1, 1)-labeling number of G, denoted by λ2,1,1(G). It was shown by King, Ras and Zhou...