Pozrikidis, C. Application of a generalized Sherman-Morrison formula to the computation of network Green’s functions and the construction of spanning trees. (English) Zbl 1465.05106 J. Stat. Mech. Theory Exp. 2015, No. 5, Paper No. P05007, 14 p. (2015). MSC: 05C50 05C82 05C05 68R10 05C90 65C05 65F20 82M60 PDFBibTeX XMLCite \textit{C. Pozrikidis}, J. Stat. Mech. Theory Exp. 2015, No. 5, Paper No. P05007, 14 p. (2015; Zbl 1465.05106) Full Text: DOI
Tang, Jianmin; Miller, Mirka; Lin, Yuqing HSAGA and its application for the construction of near-Moore digraphs. (English) Zbl 1162.05028 J. Discrete Algorithms 6, No. 1, 73-84 (2008). Reviewer: Haiko Müller (Leeds) MSC: 05C35 05C20 68W20 PDFBibTeX XMLCite \textit{J. Tang} et al., J. Discrete Algorithms 6, No. 1, 73--84 (2008; Zbl 1162.05028) Full Text: DOI
Adachi, Susumu; Peper, Ferdinand; Lee, Jia Computation by asynchronously updating cellular automata. (English) Zbl 1060.68075 J. Stat. Phys. 114, No. 1-2, 261-289 (2004). MSC: 68Q80 37B15 82C20 PDFBibTeX XMLCite \textit{S. Adachi} et al., J. Stat. Phys. 114, No. 1--2, 261--289 (2004; Zbl 1060.68075) Full Text: DOI
Germano, G. M.; Mazzanti, S. Non-deterministic closure theory and universal arrows. (English) Zbl 0987.06006 Appl. Categ. Struct. 9, No. 4, 339-364 (2001). Reviewer: Walter Tholen (Toronto) MSC: 06A15 68Q55 18C50 18A10 68Q10 PDFBibTeX XMLCite \textit{G. M. Germano} and \textit{S. Mazzanti}, Appl. Categ. Struct. 9, No. 4, 339--364 (2001; Zbl 0987.06006) Full Text: DOI
Gómez, J.; Fiol, M. A.; Yebra, J. L. A. Graphs on alphabets as models for large interconnection networks. (English) Zbl 0768.68142 Discrete Appl. Math. 37-38, 227-243 (1992). MSC: 68R10 68R15 94C15 05C20 05C35 05C78 PDFBibTeX XMLCite \textit{J. Gómez} et al., Discrete Appl. Math. 37--38, 227--243 (1992; Zbl 0768.68142) Full Text: DOI
Smyth, W. F. An upper bound on the order of graphs of given maximum degree and diameter. (English) Zbl 0641.05051 Numerical mathematics and computing, Proc. 16th Conf., Winnipeg/Manit. 1986, Congr. Numerantium 57, 201-211 (1987). Reviewer: G.Merkel MSC: 05C99 68R10 94C15 PDFBibTeX XML
Buskens, R. W.; Rogers, M. J.; Stanton, R. G. A census of tetravalent generalized Moore networks. (English) Zbl 0641.05050 Numerical mathematics and computing, Proc. 15th Conf., Winnipeg/Manitoba 1985, Congr. Numerantium 52, 255-296 (1986). Reviewer: G.Merkel MSC: 05C99 94C15 68R10 PDFBibTeX XML
Ádám, A. On certain partitions of finite directed graphs and of finite automata. (English) Zbl 0554.05031 Acta Cybern. 6, 331-346 (1983). MSC: 05C20 68Q70 08A60 PDFBibTeX XMLCite \textit{A. Ádám}, Acta Cybern. 6, 331--346 (1983; Zbl 0554.05031)
Yang, Chao-Chih; May, Charmane P. Algorithms for finding directed graph isomorphisms by finite automata. (English) Zbl 0428.68072 Int. J. Comput. Inform. Sci. 9, 117-140 (1980). MSC: 68R10 68Q45 68Q25 05C20 05-04 PDFBibTeX XMLCite \textit{C.-C. Yang} and \textit{C. P. May}, Int. J. Comput. Inform. Sci. 9, 117--140 (1980; Zbl 0428.68072) Full Text: DOI
Yang, Chao-Chih; May, Charmane P. A correction and some comments concerning graph isomorphism by finite automata. (English) Zbl 0369.94027 IEEE Trans. Comput. 27, 95-96 (1978). MSC: 68Q45 05C20 PDFBibTeX XMLCite \textit{C.-C. Yang} and \textit{C. P. May}, IEEE Trans. Comput. 27, 95--96 (1978; Zbl 0369.94027) Full Text: DOI