Lehpamer, H., 2012, *RFID Design Principles*, Artech House Publishers, Norwood, MA.

Jakes, W. C., and Cox, D. C., eds., 1994, *Microwave Mobile Communications*, Wiley-IEEE, Hoboken, NJ.

Wang, H., 2009, “Robustness of Networks,” Ph.D. thesis, Delft University of Technology, Delft, The Netherlands.

Ibrahim, A. S., Seddik, K. G., and Liu, K. J. R., 2007, “Improving Connectivity Via Relays Deployment in Wireless Sensor Networks,” GLOBECOM, Washington, DC, Nov. 26–30, pp. 1159–1163.

Frew, E. W., and Brown, T. X., 2009. “Networking Issues for Small Unmanned Aircraft Systems,” J. Intell. Rob. Syst., 54(1–3), pp. 21–37.

[CrossRef]Han, Z., Swindlehurst, A. L., and Liu, K. J. R., 2009, “Optimization of Manet Connectivity Via Smart Deployment/Movement of Unmanned Air Vehicles,” IEEE Trans. Veh. Technol., 58(7), pp. 3533–3546.

[CrossRef]Burdakov, O., Doherty, P., Holmberg, K., Kvarnström, J., and Olsson, P.-R., 2010, “Relay Positioning for Unmanned Aerial Vehicle Surveillance,” International Journal of Robotics Research, 29(8), pp. 1069–1087.

Zhan, P., Yu, K., and Swindlehurst, A. L., 2010, “Wireless Relay Communications With Unmannned Aerial Vehicles: Performance and Optimization,” IEEE Trans. Aerosp. Electron. Syst., 47(3), pp. 2068–2085.

[CrossRef]Asher, M. S., Stafford, S. J., Bamberger, R. J., Rogers, A. Q., Scheidt, D., and Chalmers, R., 2011, “Radionavigation Alternatives for U.S. Army Ground Forces in GPS Denied Environments,” International Technical Meeting of The Institute of Navigation, San Diego, CA, Jan. 24–26, pp. 508–532.

Gu, D. L., Pei, G., Ly, H., Gerla, M., Zhang, B., and Hong, X., 2000, “UAV Aided Intelligent Routing for Ad-Hoc Wireless Network in Single-Area Theater,” IEEE Wireless Communications and Networking Conference, Chicago, IL, Sept. 23–28, pp. 1220–1225.

Srinivas, A., Zussman, G., and Modiano, E., 2009, “Construction and Maintenance of Wireless Mobile Backbone Networks,” IEEE/ACM Trans. Networking, 17(1), pp. 239–252.

[CrossRef]Craparo, E. M., How, J. P., and Modiano, E., 2011, “Throughput Optimization in Mobile Backbone Networks,” IEEE Trans. Mobile Comput., 10(4), pp. 560–572.

[CrossRef]Seshu, S., and Reed, M. B., 1961, *Linear Graphs and Electrical Networks*, Addison-Wesley Pub. Co, Boston, MA.

Nagarajan, H., Rathinam, S., Darbha, S., and Rajagopal, K., 2012, “Algorithms for Synthesizing Mechanical Systems With Maximal Natural Frequencies,” Nonlinear Anal.: R. World Appl., 13(5), pp. 2154–2162.

[CrossRef]Nagarajan, H., 2014, “Synthesizing Robust Networks for Engineering Applications With Resource Constraints,” Ph.D. thesis, Texas A & M University, College Station, TX.

Mosk-Aoyama, D., 2008, “Maximum Algebraic Connectivity Augmentation is NP-Hard,” Oper. Res. Lett., 36(6), pp. 677–679.

[CrossRef]Varshney, L., 2010, “Distributed Inference Networks With Costly Wires,” IEEE American Control Conference (ACC), Baltimore, MD, June 30–July 2, pp. 1053–1058.

Maas, C., 1987, “Transportation in Graphs and the Admittance Spectrum,” Discrete Appl. Math., 16(1), pp. 31–49.

[CrossRef]Kim, Y., and Mesbahi, M., 2006, “On Maximizing the Second Smallest Eigenvalue of a State-Dependent Graph Laplacian,” IEEE Trans.Autom. Control, 51(1), pp. 116–120.

[CrossRef]Martinez, S., Cortes, J., and Bullo, F., 2007, “Motion Coordination With Distributed Information,” IEEE Control Syst. Mag., 27(4), pp. 75–88.

[CrossRef]Zavlanos, M. M., and Pappas, G. J., 2007, “Potential Fields for Maintaining Connectivity of Mobile Networks,” IEEE Trans. Rob., 23(4), pp. 812–816.

[CrossRef]Yadlapalli, S. K., Darbha, S., and Rajagopal, K. R., 2006, “Information Flow and its Relation to Stability of the Motion of Vehicles in a Rigid Formation,” IEEE Trans. Autom. Control, 51(8), pp. 1315–1319.

[CrossRef]Malik, W. A., Rajagopal, S., Darbha, S., and Rajagopal, K. R., 2009, “Maximizing the Algebraic Connectivity of a Graph Subject to a Constraint on the Maximum Number of Edges,” *Advances in Dynamics and Control: Theory, Methods and Applications*, Cambridge Scientific Publishers Ltd, Cottenham, UK, pp. 135–148.

Ghosh, A., and Boyd, S., 2006, “Upper Bounds on Algebraic Connectivity Via Convex Optimization,” Linear Algebra Appl., 418(2–3), pp. 693–707.

[CrossRef]Wei, P., and Sun, D., 2011, “Weighted Algebraic Connectivity: An Application to Airport Transportation Network,” 18th IFAC World Congress, IFAC, Milan, Italy, Aug. 28–Sept. 2, pp. 13864–13869.

Nagarajan, H., Rathinam, S., and Darbha, S., 2012, “Synthesizing Robust Communication Networks for Unmanned Aerial Vehicles With Resource Constraints,” ASME Paper No. DSCC2012-MOVIC2012-8837, pp. 393–402.

[CrossRef]Nagarajan, H., Rathinam, S., Darbha, S., and Rajagopal, K., 2012, “Synthesizing Robust Communication Networks for UAVs,” IEEE American Control Conference, Montreal, QC, June 27–29, pp. 3730–3735.

Magnanti, T. L., and Wolsey, L. A., 1995, “Optimal Trees,” *Handbooks in Operations Research and Management Science*, Vol. 7, pp. 503–615.

Nagarajan, H., Rathinam, S., Darbha, S., and Rajagopal, K., 2012, “Algorithms for Finding Diameter-Constrained Graphs With Maximum Algebraic Connectivity,” Dynamics of Information Systems: Mathematical Foundations, Springer Proceedings in Mathematics & Statistics, Vol. 20, Springer, Heidelberg, Germany, pp. 121–135.

Croes, G. A., 1958, “A Method for Solving Traveling-Salesman Problems,” Oper. Res., 6(6), pp. 791–812.

[CrossRef]Gabow, H., Galil, Z., Spencer, T., and Tarjan, R., 1986, “Efficient Algorithms for Finding Minimum Spanning Trees in Undirected and Directed Graphs,” Combinatorica, 6(2), pp. 109–122.

[CrossRef]