J. Araujo, F. Giroire, Y. Liu, R. Modrzejewski, and J. Moulierac, Energy efficient content distribution, Communications (ICC), 2013 IEEE International Conference on, pp.4233-4238, 2013.
DOI : 10.1109/icc.2013.6655228

URL : https://hal.archives-ouvertes.fr/hal-00743248

J. Baliga, R. Tucker, R. Ayre, K. W. Hinton, and W. Sorin, Energy consumption in IP networks, 34th European Conference on, p.1, 2008.

A. Bouabdallah and D. Sotteau, On the edge forwarding index problem for small graphs, Networks, vol.37, issue.38, pp.249-255, 1993.
DOI : 10.1002/net.3230230406

L. Chiaraviglio, M. Mellia, and F. Neri, Energy-aware umts core network design, The 11th International Symposium on Wireless Personal Multimedia Communications, 2008.

F. R. Chung, E. G. Jr, M. I. Reiman, and B. Simon, The forwarding index of communication networks, IEEE Transactions on Information Theory, vol.33, issue.2, pp.224-232, 1987.
DOI : 10.1109/TIT.1987.1057290

F. Giroire, D. Mazauric, J. Moulierac, and B. Onfroy, Minimizing Routing Energy Consumption: From Theoretical to Practical Results, 2010 IEEE/ACM Int'l Conference on Green Computing and Communications & Int'l Conference on Cyber, Physical and Social Computing, 2010.
DOI : 10.1109/GreenCom-CPSCom.2010.147

URL : https://hal.archives-ouvertes.fr/hal-00531468

F. Giroire, S. Perennes, and I. Tahiri, Grid spanners with low forwarding index for energy efficient networks, International Network Optimization Conference (INOC), 2015.
URL : https://hal.archives-ouvertes.fr/hal-01095179

F. Giroire, S. Pérennes, and I. Tahiri, Graphs with optimal forwarding indices: What is the best throughput you can get with a given number of edges? Research Report RR-8752, 2015.

M. C. Heydemann, J. C. Meyer, and D. Sotteau, On forwarding indices of networks, Discrete Applied Mathematics, vol.23, issue.2, pp.103-123, 1989.
DOI : 10.1016/0166-218X(89)90022-X

J. Xu and M. X. , The forwarding indices of graphs - a survey, Opuscula Mathematica, vol.33, issue.2, 2012.
DOI : 10.7494/OpMath.2013.33.2.345

T. Leighton and S. Rao, Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms, Journal of the ACM, vol.46, issue.6, pp.787-832, 1999.
DOI : 10.1145/331524.331526

N. Linial, E. London, and Y. Rabinovich, The geometry of graphs and some of its algorithmic applications, Combinatorica, vol.15, pp.577-591, 1994.

Y. Manoussakis and Z. Tuza, The forwarding index of directed networks, Discrete Applied Mathematics, vol.68, issue.3, pp.279-291, 1996.
DOI : 10.1016/0166-218X(95)00072-Y

M. Meringer, Small cubic graphsscience_engineering/csem/ research/programs/flinders-hamiltonian-cycle-project/graph-database.cfm, flinders Univ projet 16. MILLER, Mirka amd ?IRÁN, J.: Moore graphs and beyond: A survey of the degree/diameter problem, Electronic Journal of Combinatorics, vol.61, pp.1-63, 2005.

M. Miller and J. Sirán, Moore graphs and beyond: A survey of the degree/diameter problem, dynamic Survey DS14, 2013.

B. Mohar, Some applications of Laplace eigenvalues of graphs, Graph Symmetry, NATO ASI Series, pp.225-275, 1997.
DOI : 10.1007/978-94-015-8937-6_6

S. Orlowski, R. Wessäly, M. Pióro, and A. Tomaszewski, SNDlib 1.0-Survivable Network Design Library, Networks, vol.3, issue.3, pp.276-286, 2010.
DOI : 10.1002/net.20371

F. Shahrokhi and D. W. Matula, The maximum concurrent flow problem, Journal of the ACM, vol.37, issue.2, pp.318-334, 1990.
DOI : 10.1145/77600.77620

A. Sinclair, Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow, Combinatorics, Probability and Computing, vol.11, issue.04, pp.351-370, 1992.
DOI : 10.1016/0095-8956(89)90029-4

P. Solé, Expanding and forwarding, Discrete Applied Mathematics, vol.58, issue.1, pp.67-78, 1995.
DOI : 10.1016/0166-218X(93)E0118-I

L. Tassiulas and A. Ephremides, Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks, IEEE Transactions on Automatic Control, vol.37, issue.12, pp.1936-1948, 1992.
DOI : 10.1109/9.182479

W. F. De-la-vega and Y. Manoussakis, The forwarding index of communication networks with given connectivity, Discrete Applied Mathematics, vol.37, issue.38, pp.37-38, 1992.
DOI : 10.1016/0166-218X(92)90129-X

L. Fernandez-de, W. Vega, and L. M. Gordones, The Forwarding Indices of Random Graphs, Random Structures & Algorithms, vol.23, issue.1, pp.107-116, 1992.
DOI : 10.1002/rsa.3240030108

J. M. Xu and M. Xu, The forwarding indices of graphs - a survey, Opuscula Mathematica, vol.33, issue.2, 1204.
DOI : 10.7494/OpMath.2013.33.2.345