F. Garin and L. Schenato, A survey on distributed estimation and control applications using linear consensus algorithms, Networked Control Systems, ser. Lecture Notes in Control and Information Sciences, A. Bemporad, M. Heemels, and M. Johansson, vol.406, pp.75-107, 2011.
URL : https://hal.archives-ouvertes.fr/inria-00541057

S. Sundaram and C. Hadjicostis, Distributed function calculation via linear iterative strategies in the presence of malicious agents, IEEE Trans. on Automatic Control, vol.56, issue.7, pp.1495-1508, 2011.

F. Pasqualetti, A. Bicchi, and F. Bullo, Consensus computation in unreliable networks: A system theoretic approach, IEEE Trans. on Automatic Control, vol.57, issue.1, pp.90-104, 2012.

S. Sundaram and C. Hadjicostis, Distributed function calculation and consensus using linear iterative strategies, IEEE Journal on Selected Areas in Communications, vol.26, issue.4, pp.650-660, 2008.

N. O'cleary, Y. Yuan, G. Stan, and M. Barahona, Observability and coarse graining of consensus dynamics through the external equitable partition, Physical Review E, vol.88, p.13, 2013.

G. Parlangeli and G. Notarstefano, On the reachability and observability of path and cycle graphs, IEEE Trans. on Automatic Control, vol.57, issue.3, pp.743-748, 2012.

M. Ji and M. Egerstedt, Observability and estimation in distributed sensor networks, Proc. IEEE Conf. Decision Control (CDC), pp.4221-4226, 2007.

A. Kibangou and C. Commault, Algebraic characterization of observability in distance-regular consensus networks, 52nd IEEE Conf. on Decision and Control (CDC 2013), pp.1313-1318, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00913926

A. Rahmani, M. Ji, M. Mesbahi, and M. Egerstedt, Controllability of multi-agent systems from a graph-theoretic perspective, SIAM Journal on Control and Optimization, vol.48, pp.162-186, 2009.

S. Zhang, K. Camlibel, and M. Cao, Controllability of diffusivelycoupled multi-agent systems with general and distance regular coupling topologies, Proc. IEEE Conf. Decision Control (CDC), pp.759-764, 2011.

G. Notarstefano and G. Parlangeli, Reachability and observability of simple grid and torus graphs, Proc. IFAC World Congress, 2011.

, Observability and reachability of grid graphs via reduction and symmetries, Proc. IEEE CDC, pp.5923-5928, 2011.

Y. Zhou, Y. Fang, and Y. Zhang, Securing wireless sensor networks: a survey, IEEE Communications Surveys, vol.10, issue.3, pp.6-28, 2008.

A. Kibangou, Step-size sequence design for finite-time average consensus in secure wireless sensor networks, Systems and Control Letters, vol.67, pp.19-23, 2014.
URL : https://hal.archives-ouvertes.fr/hal-00967327

D. Fon-der-flaass, New prolific constructions of strongly regular graphs, Advances in Geometry, vol.2, pp.301-306, 2002.

R. Bose and D. Mesner, On linear associative algebras corresponding to association schemes of partially balanced designs, The Annals of Mathematical Statistics, vol.30, pp.21-38, 1959.

M. Mesbahi and M. Egerstedt, Graph Theoretic Methods in Multiagent Networks, 2010.

A. Brouwer, A. Cohen, and A. Neumaier, Distance-regular graphs, 1989.

A. Ghafoor and T. Bashkow, A study of odd graphs as fault-tolerant interconnection networks, IEEE Trans. on Computing, vol.40, issue.2, pp.225-232, 1991.

I. Gutman and O. Polansky, Mathematical concepts in organic chemistry, 1986.

J. Dias, Molecular Orbital calculations using chemical graph theory, 1993.

H. Longuet-higgins, Resonance structures and MO in insaturated hydrocarbons, J. Chem. Phys, vol.18, pp.265-274, 1950.

D. Cvetkovi?, I. Gutman, and N. Trinajsti?, Graph theory and molecular orbitals II, Croat. Chem. Acta, vol.44, pp.365-374, 1972.

M. Conforti, G. , and K. Vuskovic, Balanced cycles and holes in bipartite graphs, Discrete Mathematics, vol.119, pp.27-33, 1999.

T. Halford and K. Chugg, An algorithm for counting short cycles in bipartite graphs, IEEE Trans. on Information Theory, vol.52, issue.1, pp.287-292, 2006.

R. Lopez-valcarce and S. Dasgupta, On blind equalization of rank deficient nonlinear channels, Proc. IEEE Workshop on Statistical Signal Proc. (SSP), pp.269-272, 2001.

N. Eagle and A. Pentland, Reality mining: Sensing complex social systems, Personal and Ubiquitous Computing, vol.10, issue.4, pp.255-268, 2006.

N. Eagle, A. Clauset, A. Pentland, and D. Lazer, Multi-dimensional edge inference, Proc. of the National Academy of Sciences, vol.107, p.31, 2010.

G. Karypis and V. Kumar, A parallel algorithm for multilevel graph partitioning and sparse matrix ordering, Journal of distributed computing, vol.48, pp.71-95, 1998.

E. Van-dam and W. Haemers, Spectral characterizations of some distance regular graphs, Journal of algebraic combinatorics, vol.15, pp.189-202, 2002.

C. Godsil and G. Royle, Algebraic graph theory, 2001.