The Least Algebraic Connectivity of Graphs

<div>The graph <svg height="12.7178pt" id="M154" style="vertical-align:-3.42947pt" version="1.1" viewbox="-0.0498162 -9.28833 36.7405 12.7178" width="36.7405pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.013,0,0,-0.013,0,0)"><path d="M620 675H597C578 656 570 650 541 650H144C112 650 104 653 94 675H72C59 618 42 552 23 493L53 491C71 534 88 564 105 585C124 608 144 615 238 615H290L197 121C182 40 174 34 88 28L82 0H361L367 28C275 34 266 38 281 121L374 615H441C522 615 543 608 553 583C562 560 566 531 565 493L597 494C603 551 612 629 620 675Z" id="g113-85"></path><glyph.data ascent="3473" descent="-2876" horiz-adv-x="637" vert-adv-y="637"></glyph.data></g><g transform="matrix(.013,0,0,-0.013,8.285,0)"><path d="M300 -147C201 -63 143 98 143 270S200 602 300 686L282 710C136 610 70 450 70 271V270C70 89 136 -72 282 -170L300 -147Z" id="g113-41"></path><glyph.data ascent="3473" descent="-2876" horiz-adv-x="346" vert-adv-y="346"></glyph.data></g><g transform="matrix(.013,0,0,-0.013,12.783,0)"><path d="M570 304C570 398 525 448 414 448C385 448 343 445 312 434L329 511L321 518C297 504 262 482 244 460L233 411C195 397 159 381 128 358L135 332C160 347 189 360 224 373L111 -147C97 -210 84 -218 17 -231L13 -257L254 -247L259 -218L233 -216C183 -212 177 -202 189 -142L218 -1C238 -10 266 -12 283 -12C351 3 429 48 483 105C543 168 570 242 570 304ZM482 289C482 161 380 33 304 33C278 33 248 51 233 69L303 396C326 400 352 403 369 403C428 403 482 380 482 289Z" id="g113-113"></path><glyph.data ascent="3473" descent="-2876" horiz-adv-x="593" vert-adv-y="593"></glyph.data></g><g transform="matrix(.013,0,0,-0.013,20.493,0)"><path d="M95 130C70 130 46 113 46 88C46 72 54 64 59 64C93 55 121 33 121 -3C121 -41 93 -68 44 -88L55 -117C117 -98 186 -56 186 22C186 91 131 130 95 130Z" id="g113-45"></path><glyph.data ascent="3473" descent="-2876" horiz-adv-x="228" vert-adv-y="228"></glyph.data></g><g transform="matrix(.013,0,0,-0.013,25.636,0)"><path d="M474 429L457 433C435 440 389 448 367 448C348 448 323 446 309 443C266 434 195 406 148 366C78 307 23 210 23 101C23 35 55 -12 92 -12C118 -12 146 1 196 35C247 70 311 130 346 173H348L281 -148C268 -211 256 -221 208 -229L191 -232L187 -257L433 -245L437 -219L411 -216C357 -210 350 -205 362 -140L427 207C447 315 461 381 474 429ZM387 387C379 337 363 262 355 236C318 180 201 57 142 57C126 57 112 81 112 128C112 205 150 321 220 376C244 395 280 403 312 403C345 403 370 396 387 387Z" id="g113-114"></path><glyph.data ascent="3473" descent="-2876" horiz-adv-x="491" vert-adv-y="491"></glyph.data></g><g transform="matrix(.013,0,0,-0.013,32.02,0)"><path d="M275 270C275 450 212 609 64 710L45 686C145 604 203 442 203 270S147 -63 45 -147L64 -170C213 -68 275 89 275 270Z" id="g113-42"></path><glyph.data ascent="3473" descent="-2876" horiz-adv-x="346" vert-adv-y="346"></glyph.data></g></svg>.</div>

Discrete Dynamics in Nature and Society

The Least Algebraic Connectivity of Graphs

Figure 1