CLASSIFYING STRONGLY REGULAR GRAPHS USING LEXICAL ORDERING OF ADJACENCY MATRICES
- Author
- Kris Coolsaet (UGent) and Veerle Fack (UGent)
- Organization
Citation
Please use this url to cite or link to this publication: http://hdl.handle.net/1854/LU-330691
- MLA
- Coolsaet, Kris, and Veerle Fack. “CLASSIFYING STRONGLY REGULAR GRAPHS USING LEXICAL ORDERING OF ADJACENCY MATRICES.” COMPUTERS & MATHEMATICS WITH APPLICATIONS, vol. 21, no. 2–3, PERGAMON-ELSEVIER SCIENCE LTD, 1991, pp. 15–21.
- APA
- Coolsaet, K., & Fack, V. (1991). CLASSIFYING STRONGLY REGULAR GRAPHS USING LEXICAL ORDERING OF ADJACENCY MATRICES. COMPUTERS & MATHEMATICS WITH APPLICATIONS, 21(2–3), 15–21.
- Chicago author-date
- Coolsaet, Kris, and Veerle Fack. 1991. “CLASSIFYING STRONGLY REGULAR GRAPHS USING LEXICAL ORDERING OF ADJACENCY MATRICES.” COMPUTERS & MATHEMATICS WITH APPLICATIONS 21 (2–3): 15–21.
- Chicago author-date (all authors)
- Coolsaet, Kris, and Veerle Fack. 1991. “CLASSIFYING STRONGLY REGULAR GRAPHS USING LEXICAL ORDERING OF ADJACENCY MATRICES.” COMPUTERS & MATHEMATICS WITH APPLICATIONS 21 (2–3): 15–21.
- Vancouver
- 1.Coolsaet K, Fack V. CLASSIFYING STRONGLY REGULAR GRAPHS USING LEXICAL ORDERING OF ADJACENCY MATRICES. COMPUTERS & MATHEMATICS WITH APPLICATIONS. 1991;21(2–3):15–21.
- IEEE
- [1]K. Coolsaet and V. Fack, “CLASSIFYING STRONGLY REGULAR GRAPHS USING LEXICAL ORDERING OF ADJACENCY MATRICES,” COMPUTERS & MATHEMATICS WITH APPLICATIONS, vol. 21, no. 2–3, pp. 15–21, 1991.
@article{330691, author = {{Coolsaet, Kris and Fack, Veerle}}, issn = {{0898-1221}}, journal = {{COMPUTERS & MATHEMATICS WITH APPLICATIONS}}, language = {{eng}}, number = {{2-3}}, pages = {{15--21}}, publisher = {{PERGAMON-ELSEVIER SCIENCE LTD}}, title = {{CLASSIFYING STRONGLY REGULAR GRAPHS USING LEXICAL ORDERING OF ADJACENCY MATRICES}}, volume = {{21}}, year = {{1991}}, }