{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T19:34:39Z","timestamp":1785612879677,"version":"3.56.0"},"reference-count":34,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Automat. Contr."],"published-print":{"date-parts":[[2015]]},"DOI":"10.1109\/tac.2015.2444191","type":"journal-article","created":{"date-parts":[[2015,6,12]],"date-time":"2015-06-12T01:24:32Z","timestamp":1434072272000},"page":"1-1","source":"Crossref","is-referenced-by-count":33,"title":["On the Smallest Eigenvalue of Grounded Laplacian Matrices"],"prefix":"10.1109","author":[{"given":"Mohammad","family":"Pirani","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shreyas","family":"Sundaram","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/780542.780646"},{"key":"ref32","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/978-3-662-12788-9_6","article-title":"Concentration","volume":"16","author":"mcdiarmid","year":"1998","journal-title":"Probabilistic Methods for Algorithmic Discrete Mathematics"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20151"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2005.1498374"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511813603"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2013.2261187"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2006.887293"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2010.5718151"},{"key":"ref13","first-page":"818","article-title":"Leader selection for smooth convergence via fast mixing","author":"clark","year":"0","journal-title":"Proc IEEE Conf Decision Control"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2013.2281473"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2011.6161482"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2013.6761082"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2006.377619"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2010.5717528"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1257\/mic.2.1.112"},{"key":"ref28","first-page":"1","article-title":"Randomized rumour spreading: The effect of the network topology","author":"panagiotou","year":"2013","journal-title":"Combinator Probabil Comput"},{"key":"ref4","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-0163-9","author":"godsil","year":"2001","journal-title":"Algebraic Graph Theory"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611971446"},{"key":"ref3","doi-asserted-by":"crossref","DOI":"10.2307\/j.ctvcm4gh1","author":"jackson","year":"2010","journal-title":"Social and Economic Networks"},{"key":"ref6","author":"cvetkovic","year":"1980","journal-title":"Spectra of Graphs Theory and Application"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20171"},{"key":"ref5","author":"chung","year":"1997","journal-title":"Spectral Graph Theory"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/S0024-3795(97)10080-5"},{"key":"ref7","doi-asserted-by":"crossref","first-page":"298","DOI":"10.21136\/CMJ.1973.101168","article-title":"Algebraic connectivity of graphs","volume":"23","author":"fiedler","year":"1973","journal-title":"Czech Math J"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511814068"},{"key":"ref9","first-page":"871","article-title":"The Laplacian spectrum of graphs","author":"mohar","year":"1991","journal-title":"Graph Theory Combinatorics Appl"},{"key":"ref1","author":"harary","year":"1973","journal-title":"Graphical Enumeration"},{"key":"ref20","article-title":"A graph-theoretic approach on optimizing informed-node selection in multi-agent tracking control","author":"shi","year":"2013","journal-title":"Physica D Nonlin Phenom"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1120.0570"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2014.10.034"},{"key":"ref24","author":"horn","year":"1990","journal-title":"Matrix Analysis"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ACC.2014.6859421"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ACC.2006.1657268"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611971262"}],"container-title":["IEEE Transactions on Automatic Control"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9\/7393629\/7122271.pdf?arnumber=7122271","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T15:58:16Z","timestamp":1642003096000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7122271\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"references-count":34,"URL":"https:\/\/doi.org\/10.1109\/tac.2015.2444191","relation":{},"ISSN":["0018-9286","1558-2523"],"issn-type":[{"value":"0018-9286","type":"print"},{"value":"1558-2523","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]}}}