The Extremal Permanental Sum for a Quasi-Tree Graph

<p>Graphs <svg height="13.8999pt" id="M111" style="vertical-align:-3.94351pt" version="1.1" viewbox="-0.0498162 -9.95639 15.8713 13.8999" width="15.8713pt" xmlns="http://www.w3.org/2000/svg"><g transform="matrix(.013,0,0,-0.013,0,0)"><path d="M584 650H137L131 622C214 614 217 612 200 521L125 127C109 41 101 35 23 28L17 0H288L294 28C201 35 193 42 209 128L242 309H348C440 309 442 300 443 226H471L510 422H482C452 354 449 348 357 348H251L295 575C302 609 304 615 338 615H426C502 615 517 604 526 581C534 560 536 524 537 492L565 494C574 554 583 631 584 650Z"></path></g><g transform="matrix(.0091,0,0,-0.0091,7.895,-5.741)"><path d="M781 91L765 118C733 86 702 70 693 70C686 70 685 77 692 106L738 297C772 439 736 451 712 451S675 445 647 431C605 410 526 356 452 257H450L459 294C491 426 459 451 429 451C403 451 386 445 361 431C312 404 239 343 170 253H168L188 333C208 411 205 451 175 451C148 451 85 417 24 346L39 318C57 338 100 374 112 374C120 374 122 372 115 339C91 226 62 112 28 -6L37 -12C59 -4 87 3 114 6C125 68 142 127 154 168C184 227 316 383 372 383C397 383 396 366 381 289C362 192 338 92 312 -6L317 -12C339 -5 367 3 396 6L434 170C468 234 598 383 650 383C668 383 676 369 664 319L609 90C593 23 600 -12 629 -12C654 -12 722 23 781 91Z"></path></g><g transform="matrix(.0091,0,0,-0.0091,6.786,3.784)"><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></svg> and <svg height="15.535pt" id="M112" style="vertical-align:-3.9436pt" version="1.1" viewbox="-0.0498162 -11.5914 26.2646 15.535" width="26.2646pt" xmlns="http://www.w3.org/2000/svg"><g transform="matrix(.013,0,0,-0.013,0,0)"><path d="M828 650H570L564 622C646 614 650 609 634 524L604 366H253L281 524C296 608 308 615 382 622L388 650H132L126 622C211 615 214 609 198 524L121 122C106 42 102 35 23 28L17 0H276L282 28C196 35 191 40 206 122L243 324H597L559 123C544 42 537 35 452 28L446 0H710L716 28C632 35 628 43 643 122L719 524C735 610 741 615 822 622L828 650Z"></path></g><g transform="matrix(.0091,0,0,-0.0091,10.923,-5.741)"><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,15.582,-5.741)"><path d="M556 236V289H337V504H275V289H56V236H275V-4H337V236H556Z"></path></g><g transform="matrix(.0091,0,0,-0.0091,21.143,-5.741)"><path d="M414 144C384 79 371 75 317 75H135L276 221C367 316 408 376 408 465C408 570 327 635 237 635C179 635 131 609 100 575L42 494L67 471C94 510 138 565 205 565C277 565 321 517 321 435C321 348 258 270 195 195C146 137 88 81 33 26V0H411C423 44 433 88 446 135L414 144Z"></path></g><g transform="matrix(.0091,0,0,-0.0091,10.075,3.784)"><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></svg> in Lemma <a href="https://static.hindawi.com/articles/complexity/volume-2019/4387650/figures/#lem2.2">2</a>.</p>

Complexity

The Extremal Permanental Sum for a Quasi-Tree Graph

Figure 1