Dominating sets and domination polynomials of paths.
Alikhani, Saeid, Peng, Yee-Hock (2009)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Alikhani, Saeid, Peng, Yee-Hock (2009)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Toufik Mansour, Mark Shattuck (2011)
Open Mathematics
Similarity:
Let L n, n ≥ 1, denote the sequence which counts the number of paths from the origin to the line x = n − 1 using (1, 1), (1, −1), and (1, 0) steps that never dip below the x-axis (called Motzkin left factors). The numbers L n count, among other things, certain restricted subsets of permutations and Catalan paths. In this paper, we provide new combinatorial interpretations for these numbers in terms of finite set partitions. In particular, we identify four classes of the partitions of...
Stănică, Pantelimon (2001)
JIPAM. Journal of Inequalities in Pure & Applied Mathematics [electronic only]
Similarity:
Huang, Qiliang (2010)
Journal of Inequalities and Applications [electronic only]
Similarity:
Li, Yu-Shuang, Wang, Jun (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Cao, Yonglin (2006)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Xu, Houbao, Guo, Weihua, Yu, Jingyuan, Zhu, Guangtian (2005)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Hussain, S., Pečarić, J., Perić, I. (2008)
Journal of Inequalities and Applications [electronic only]
Similarity:
Prem Nath Arora, Subhash Chowdhary (1984)
Kybernetika
Similarity:
Steinmetz, Norbert (2004)
Portugaliae Mathematica. Nova Série
Similarity:
Bouchard, Pierre, Chang, Hungyung, Ma, Jun, Yeh, Jean, Yeh, Yeong-Nan (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity: