Table of Contents Author Guidelines Submit a Manuscript
International Journal of Mathematics and Mathematical Sciences
Volume 2006 (2006), Article ID 96327, 10 pages
http://dx.doi.org/10.1155/IJMMS/2006/96327

Combinatorial identities by way of Wilf's multigraph model

1Mesa State College, 1100 North Avenue, Grand Junction 81502, CO, USA
2Saint Joseph's University, 5600 City Avenue, Philadelphia 19131-1395, PA, USA

Received 4 February 2005; Revised 29 October 2006; Accepted 9 November 2006

Copyright © 2006 Hindawi Publishing Corporation. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. E. Calabi and H. S. Wilf, “On the sequential and random selection of subspaces over a finite field,” Journal of Combinatorial Theory. Series A, vol. 22, no. 1, pp. 107–109, 1977. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  2. R. J. Clarke and M. Sved, “Derangement types,” Bulletin of the Institute of Combinatorics and Its Applications, vol. 3, pp. 21–30, 1991. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  3. P. Klingsberg, “A combinatorial family of labeled trees,” Journal of Algorithms, vol. 1, no. 1, pp. 104–106, 1980. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  4. A. Nijenhuis and H. S. Wilf, Combinatorial Algorithms, Academic Press, New York, 2nd edition, 1978. View at Zentralblatt MATH · View at MathSciNet
  5. N. J. A. Sloane, Ed., The on-Line Encyclopedia of Integer Sequences, N. J. A. Sloane, Ed., retrieved July 2006, from AT &T Labs-Research. http://www.research.att.com/~njas/sequences/.
  6. R. P. Stanley, Enumerative Combinatorics. Volume I., The Wadsworth & Brooks/Cole Mathematics Series, Wadsworth & Brooks/Cole Advanced Books & Software, California, 1986. View at Zentralblatt MATH · View at MathSciNet
  7. H. S. Wilf, “A unified setting for sequencing, ranking, and selection algorithms for combinatorial objects,” Advances in Mathematics, vol. 24, no. 3, pp. 281–291, 1977. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet