On the Minimum Variable Connectivity Index of Unicyclic Graphs with a Given Order

<div>The graph <svg height="15.0129pt" id="M232" style="vertical-align:-5.05651pt" version="1.1" viewbox="-0.0498162 -9.95639 19.1165 15.0129" width="19.1165pt" 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="M524 497C519 556 514 633 513 650H40V615C113 608 122 601 122 511V142C122 48 113 42 40 35V0H351V35C264 42 256 48 256 142V300H338C427 300 437 292 448 224H484V423H448C437 359 427 350 338 350H256V571C256 604 260 606 295 606H345C401 606 428 599 449 577C466 559 479 529 489 491L524 497Z"></path></g><g transform="matrix(.0091,0,0,-0.0091,7.202,-5.741)"><path d="M397 380C406 395 404 411 396 425S369 451 350 451C302 451 239 372 192 294H189L199 338C214 407 207 451 180 451C152 451 83 405 30 345L48 318C87 354 117 372 125 372S135 362 127 324L55 -5L61 -12C87 -5 117 3 139 5C154 87 168 162 179 207C198 250 240 310 260 332C281 355 297 366 307 366C321 366 333 360 347 346C351 342 360 342 369 348C379 355 389 366 397 380Z"></path></g><g transform="matrix(.0091,0,0,-0.0091,11.089,-5.741)"><path d="M98 134C72 134 46 117 46 90C46 73 55 65 60 64C95 55 124 32 124 -4C124 -42 95 -68 44 -89L57 -123C122 -104 194 -60 194 22C194 94 136 134 98 134Z"></path></g><g transform="matrix(.0091,0,0,-0.0091,13.246,-5.741)"><path d="M357 391C357 416 325 451 270 451C241 451 179 431 146 400C109 365 97 334 97 307C97 248 143 213 196 180C250 146 261 123 261 101C261 75 237 40 190 40C153 40 110 72 86 109C81 116 68 119 55 112C37 102 24 87 24 66C24 30 85 -12 137 -12C229 -12 331 62 331 140C331 189 304 218 236 260C197 284 164 309 164 346C164 381 194 400 220 400C259 400 282 380 304 350C310 342 321 339 330 344C347 353 357 372 357 391Z"></path></g><g transform="matrix(.0091,0,0,-0.0091,7.202,3.838)"><path d="M504 89L488 119C453 85 428 69 416 69C408 69 405 75 412 102L462 304C492 438 460 451 436 451S388 441 356 423C311 397 229 336 170 256H168L189 340C208 418 200 451 177 451C144 451 82 413 24 352L40 322C65 345 98 369 108 369C114 369 119 363 112 335L28 -3L36 -12C54 -3 83 4 112 10C125 73 138 122 153 174C205 258 328 382 376 382C395 382 399 369 384 305L330 93C312 25 323 -12 351 -12C378 -12 439 21 504 89Z"></path></g><g transform="matrix(.0091,0,0,-0.0091,11.861,3.838)"><path d="M98 134C72 134 46 117 46 90C46 73 55 65 60 64C95 55 124 32 124 -4C124 -42 95 -68 44 -89L57 -123C122 -104 194 -60 194 22C194 94 136 134 98 134Z"></path></g><g transform="matrix(.0091,0,0,-0.0091,14.018,3.838)"><path d="M462 177V227H365V632H320C217 496 116 350 21 208V177H284V109C284 43 280 38 190 31V0H451V31C369 38 365 43 365 108V177H462ZM284 227H88C155 336 218 430 282 519H284V227Z"></path></g></svg> (used in Lemma <a href="https://static.hindawi.com/articles/ddns/volume-2020/1217567/figures/#lem10">10</a>).</div>

Discrete Dynamics in Nature and Society

fig4

Figure 4

Figure 4: On the Minimum Variable Connectivity Index of Unicyclic Graphs with a Given Order 