Skip to content
Free planNo credit card requiredStart writing

article · Journal of Combinatorial Theory Series B · 2010

The Q-polynomial idempotents of a distance-regular graph

Aleksandar Jurišić, Paul Terwilliger, Arjana Žitnik

Cited by 7Abstract and details only

Abstract

The index has no abstract for this paper. The publisher’s page may have one.

Cite this paper

APA 7

Jurišić, A., Terwilliger, P., & Žitnik, A. (2010). The Q-polynomial idempotents of a distance-regular graph. Journal of Combinatorial Theory Series B, 100(6), 683–690. https://doi.org/10.1016/j.jctb.2010.07.002

MLA 9

Jurišić, Aleksandar, et al. “The Q-polynomial idempotents of a distance-regular graph.” Journal of Combinatorial Theory Series B, vol. 100, no. 6, 2010, pp. 683–90, https://doi.org/10.1016/j.jctb.2010.07.002.

Chicago

Jurišić, Aleksandar, Paul Terwilliger, and Arjana Žitnik. 2010. “The Q-polynomial idempotents of a distance-regular graph.” Journal of Combinatorial Theory Series B 100 (6): 683–90. https://doi.org/10.1016/j.jctb.2010.07.002.

Harvard

Jurišić, A., Terwilliger, P. and Žitnik, A. (2010) ‘The Q-polynomial idempotents of a distance-regular graph’, Journal of Combinatorial Theory Series B, 100(6), pp. 683–690. Available at: https://doi.org/10.1016/j.jctb.2010.07.002.

BibTeX
@article{jurisic2010polynomial,
  title = {{The Q-polynomial idempotents of a distance-regular graph}},
  author = {Jurišić, Aleksandar and Terwilliger, Paul and Žitnik, Arjana},
  journal = {Journal of Combinatorial Theory Series B},
  volume = {100},
  number = {6},
  pages = {683--690},
  year = {2010},
  doi = {10.1016/j.jctb.2010.07.002}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.