Sciweavers

547 search results - page 58 / 110
» dm 2008
Sort
View
89
Voted
DM
1998
56views more  DM 1998»
15 years 15 days ago
Factoring cardinal product graphs in polynomial time
In this paper a polynomial algorithm for the prime factorization of finite, connected nonbipartite graphs with respect to the cardinal product is presented. This algorithm also d...
Wilfried Imrich
90
Voted
DM
1998
80views more  DM 1998»
15 years 15 days ago
Basis partitions
We study basis partitions, introduced by Hansraj Gupta in 1978. For this family of partitions, we give a recurrence, a generating function, identities relating basis partitions to...
Jennifer M. Nolan, Carla D. Savage, Herbert S. Wil...
84
Voted
DM
1998
72views more  DM 1998»
15 years 15 days ago
Kazhdan-Lusztig polynomials for certain varieties of incomplete flags
Abstract. We give explicit formulas for the Kazhdan-Lusztig P- and Rpolynomials for permutations coming from the variety F1,n−1 of incomplete flags consisting of a line and a hy...
Boris Shapiro, Michael Shapiro, Alek Vainshtein
DM
1999
122views more  DM 1999»
15 years 15 days ago
Parking functions, valet functions and priority queues
We construct a bijection between labeled trees and allowable pairs of permutations sorted by a priority queue. These are also the pairs of permutations that avoid the pattern pairs...
Julian D. Gilbey, Louis H. Kalikow
DM
1999
89views more  DM 1999»
15 years 15 days ago
On the distribution of eigenvalues of graphs
Let G be a simple graph with n( 2) vertices, and i(G) be the ith largest eigenvalue of G. In this paper we obtain the following: If 3(G) < 0, and there exists some index k, 2 ...
Alexander K. Kelmans, Xuerong Yong