{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:05:44Z","timestamp":1740107144928,"version":"3.37.3"},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2018,6,23]],"date-time":"2018-06-23T00:00:00Z","timestamp":1529712000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2018,9]]},"DOI":"10.1007\/s00373-018-1917-5","type":"journal-article","created":{"date-parts":[[2018,6,23]],"date-time":"2018-06-23T11:16:24Z","timestamp":1529752584000},"page":"863-877","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Characterization of Q-Polynomial Distance-Regular Graphs Using the Intersection Numbers"],"prefix":"10.1007","volume":"34","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2821-6236","authenticated-orcid":false,"given":"Supalak","family":"Sumalroj","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,6,23]]},"reference":[{"key":"1917_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-74341-2","volume-title":"Distance-Regular Graphs","author":"AE Brouwer","year":"1989","unstructured":"Brouwer, A.E., Cohen, A.M., Neumaier, A.: Distance-Regular Graphs. Springer, Berlin (1989)"},{"key":"1917_CR2","doi-asserted-by":"publisher","first-page":"2289","DOI":"10.1016\/j.laa.2012.10.025","volume":"438","author":"E Hanson","year":"2013","unstructured":"Hanson, E.: A characterization of Leonard pairs using the parameters \n                    \n                      \n                    \n                    $$\\{a_i\\}_{i=0}^d$$\n                    \n                      \n                        \n                          \n                            {\n                            \n                              a\n                              i\n                            \n                            }\n                          \n                          \n                            i\n                            =\n                            0\n                          \n                          d\n                        \n                      \n                    \n                  . Linear Algebra Appl. 438, 2289\u20132305 (2013)","journal-title":"Linear Algebra Appl."},{"key":"1917_CR3","doi-asserted-by":"publisher","first-page":"683","DOI":"10.1016\/j.jctb.2010.07.002","volume":"100","author":"A Juri\u0161i\u0107","year":"2010","unstructured":"Juri\u0161i\u0107, A., Terwilliger, P., \u017ditnik, A.: The \n                    \n                      \n                    \n                    $$Q$$\n                    \n                      \n                        Q\n                      \n                    \n                  -polynomial idempotents of a distance-regular graph. J. Comb. Theory Ser. B 100, 683\u2013690 (2010)","journal-title":"J. Comb. Theory Ser. B"},{"key":"1917_CR4","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.jcta.2011.07.008","volume":"119","author":"H Kurihara","year":"2012","unstructured":"Kurihara, H., Nozaki, H.: A characterization of \n                    \n                      \n                    \n                    $$Q$$\n                    \n                      \n                        Q\n                      \n                    \n                  -polynomial association schemes. J. Comb. Theory Ser. A 119, 57\u201362 (2012)","journal-title":"J. Comb. Theory Ser. A"},{"key":"1917_CR5","doi-asserted-by":"publisher","first-page":"2527","DOI":"10.1016\/j.laa.2011.01.003","volume":"434","author":"K Nomura","year":"2011","unstructured":"Nomura, K., Terwilliger, P.: Tridiagonal matrices with nonnegative entries. Linear Algebra Appl. 434, 2527\u20132538 (2011)","journal-title":"Linear Algebra Appl."},{"key":"1917_CR6","doi-asserted-by":"publisher","first-page":"3090","DOI":"10.1016\/j.disc.2007.08.034","volume":"308","author":"AA Pascasio","year":"2008","unstructured":"Pascasio, A.A.: A characterization of \n                    \n                      \n                    \n                    $$Q$$\n                    \n                      \n                        Q\n                      \n                    \n                  -polynomial distance-regular graphs. Discret. Math. 308, 3090\u20133096 (2008)","journal-title":"Discret. Math."},{"key":"1917_CR7","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1016\/0097-3165(87)90042-2","volume":"45","author":"P Terwilliger","year":"1987","unstructured":"Terwilliger, P.: A characterization of \n                    \n                      \n                    \n                    $$P$$\n                    \n                      \n                        P\n                      \n                    \n                  - and \n                    \n                      \n                    \n                    $$Q$$\n                    \n                      \n                        Q\n                      \n                    \n                  -polynomial association schemes. J. Comb. Theory Ser. A 45, 8\u201326 (1987)","journal-title":"J. Comb. Theory Ser. A"},{"key":"1917_CR8","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1016\/0012-365X(93)E0170-9","volume":"137","author":"P Terwilliger","year":"1995","unstructured":"Terwilliger, P.: A new inequality for distance-regular graphs. Discret. Math. 137, 319\u2013332 (1995)","journal-title":"Discret. Math."},{"key":"1917_CR9","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1023\/A:1022494701663","volume":"1","author":"P Terwilliger","year":"1992","unstructured":"Terwilliger, P.: The subconstituent algebra of an association scheme I. J. Algebraic Comb. 1, 363\u2013388 (1992)","journal-title":"J. Algebraic Comb."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-018-1917-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-018-1917-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-018-1917-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,22]],"date-time":"2019-06-22T19:13:23Z","timestamp":1561230803000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-018-1917-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6,23]]},"references-count":9,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2018,9]]}},"alternative-id":["1917"],"URL":"https:\/\/doi.org\/10.1007\/s00373-018-1917-5","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2018,6,23]]},"assertion":[{"value":"6 July 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 June 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 June 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}