The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Paul Terwilliger: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Paul Terwilliger
    The classification of distance-regular graphs of type IIB. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1988, v:8, n:1, pp:125-132 [Journal]
  2. Paul Terwilliger
    Two Linear Transformations each Tridiagonal with Respect to an Eigenbasis of the other; Comments on the Parameter Array. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2005, v:34, n:2-3, pp:307-332 [Journal]
  3. Eiichi Bannai, Akihiro Munemasa, Sung-Yell Song, Paul Terwilliger
    Preface. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:264, n:1-3, pp:1- [Journal]
  4. John S. Caughman IV, Mark S. MacLean, Paul Terwilliger
    The Terwilliger algebra of an almost-bipartite P- and Q-polynomial association scheme. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:292, n:1-3, pp:17-44 [Journal]
  5. Mark S. MacLean, Paul Terwilliger
    Taut distance-regular graphs and the subconstituent algebra. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:15, pp:1694-1721 [Journal]
  6. Junie T. Go, Paul Terwilliger
    Tight Distance-regular Graphs and the Subconstituent Algebra*1. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2002, v:23, n:7, pp:793-816 [Journal]
  7. Garth A. Dickie, Paul Terwilliger
    Dual Bipartite Q-polynomial Distance-regular Graphs. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 1996, v:17, n:7, pp:613-623 [Journal]
  8. Paul Terwilliger
    P- and Q-Polynomial Association Schemes and Their Antipodal P-Polynomial Covers. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 1993, v:14, n:4, pp:355-358 [Journal]
  9. Paul Terwilliger, Chih-wen Weng
    Distance-regular graphs, pseudo primitive idempotents, and the Terwilliger algebra. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2004, v:25, n:2, pp:287-298 [Journal]
  10. Paul Terwilliger, Chih-wen Weng
    An inequality for regular near polygons. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2005, v:26, n:2, pp:227-235 [Journal]
  11. Michael S. Lang, Paul Terwilliger
    Almost-bipartite distance-regular graphs with the Q-polynomial property. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2007, v:28, n:1, pp:258-265 [Journal]
  12. Paul Terwilliger
    The Displacement and Split Decompositions for a Q-Polynomial Distance-regular Graph. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2005, v:21, n:2, pp:263-276 [Journal]
  13. Paul Terwilliger
    A characterization of P- and Q-polynomial association schemes. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1987, v:45, n:1, pp:8-26 [Journal]
  14. Paul Terwilliger
    P and Q polynomial schemes with q = -1. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1987, v:42, n:1, pp:64-67 [Journal]
  15. Paul Terwilliger
    The diameter of bipartite distance-regular graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1982, v:32, n:2, pp:182-188 [Journal]
  16. Paul Terwilliger
    Distance-regular graphs and (s, c, a, k)-graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1983, v:34, n:2, pp:151-164 [Journal]
  17. Paul Terwilliger
    Distance-regular graphs with girth 3 or 4: I. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1985, v:39, n:3, pp:265-281 [Journal]
  18. Paul Terwilliger
    A class of distance-regular graphs that are Q-polynomial. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1986, v:40, n:2, pp:213-223 [Journal]
  19. Paul Terwilliger
    Eigenvalue multiplicities of highly symmetric graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1982, v:41, n:3, pp:295-302 [Journal]
  20. Paul Terwilliger
    The Johnson graph J(d, r) is unique if (d, r) != (2, 8). [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1986, v:58, n:2, pp:175-189 [Journal]
  21. Paul Terwilliger
    A new feasibility condition for distance-regular graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1986, v:61, n:2-3, pp:311-315 [Journal]
  22. Kequan Ding, Paul Terwilliger
    On Garsia-Remmel problem of rook equivalence. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:149, n:1-3, pp:59-68 [Journal]
  23. Paul Terwilliger
    A new inequality for distance-regular graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:137, n:1-3, pp:319-332 [Journal]

  24. The subconstituent algebra of a bipartite distance-regular graph; thin modules with endpoint two. [Citation Graph (, )][DBLP]


  25. Distance-regular graphs and the q-tetrahedron algebra. [Citation Graph (, )][DBLP]


  26. Distance-regular graphs with light tails. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.151secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002