Classification of a class of distance-regular graphs via completely regular codes. Rifà, J. & Huguet, L. Discret. Appl. Math., 26(2-3):289–300, 1990.
Paper doi bibtex @article{DBLP:journals/dam/RifaH90,
author = {Josep Rif{\`{a}} and
Ll. Huguet},
title = {Classification of a class of distance-regular graphs via completely
regular codes},
journal = {Discret. Appl. Math.},
volume = {26},
number = {2-3},
pages = {289--300},
year = {1990},
url = {https://doi.org/10.1016/0166-218X(90)90106-M},
doi = {10.1016/0166-218X(90)90106-M},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/RifaH90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
Downloads: 0
{"_id":"K6ShBpR6abeWecaFB","bibbaseid":"rif-huguet-classificationofaclassofdistanceregulargraphsviacompletelyregularcodes-1990","authorIDs":[],"author_short":["Rifà, J.","Huguet, L."],"bibdata":{"bibtype":"article","type":"article","author":[{"firstnames":["Josep"],"propositions":[],"lastnames":["Rifà"],"suffixes":[]},{"firstnames":["Ll."],"propositions":[],"lastnames":["Huguet"],"suffixes":[]}],"title":"Classification of a class of distance-regular graphs via completely regular codes","journal":"Discret. Appl. Math.","volume":"26","number":"2-3","pages":"289–300","year":"1990","url":"https://doi.org/10.1016/0166-218X(90)90106-M","doi":"10.1016/0166-218X(90)90106-M","timestamp":"Thu, 20 Feb 2020 00:00:00 +0100","biburl":"https://dblp.org/rec/journals/dam/RifaH90.bib","bibsource":"dblp computer science bibliography, https://dblp.org","bibtex":"@article{DBLP:journals/dam/RifaH90,\n author = {Josep Rif{\\`{a}} and\n Ll. Huguet},\n title = {Classification of a class of distance-regular graphs via completely\n regular codes},\n journal = {Discret. Appl. Math.},\n volume = {26},\n number = {2-3},\n pages = {289--300},\n year = {1990},\n url = {https://doi.org/10.1016/0166-218X(90)90106-M},\n doi = {10.1016/0166-218X(90)90106-M},\n timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},\n biburl = {https://dblp.org/rec/journals/dam/RifaH90.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n","author_short":["Rifà, J.","Huguet, L."],"key":"DBLP:journals/dam/RifaH90","id":"DBLP:journals/dam/RifaH90","bibbaseid":"rif-huguet-classificationofaclassofdistanceregulargraphsviacompletelyregularcodes-1990","role":"author","urls":{"Paper":"https://doi.org/10.1016/0166-218X(90)90106-M"},"downloads":0},"bibtype":"article","biburl":"https://dblp.org/pid/r/JosepRifa.bib","creationDate":"2020-04-19T08:16:27.686Z","downloads":0,"keywords":[],"search_terms":["classification","class","distance","regular","graphs","via","completely","regular","codes","rifà","huguet"],"title":"Classification of a class of distance-regular graphs via completely regular codes","year":1990,"dataSources":["69wMj4xXo8SwSq5Qt"]}