Investigation of General Power Sum-Connectivity Index for Some Classes of Extremal Graphs

<div>A graph <svg height="8.8423pt" id="M131" style="vertical-align:-0.2064009pt" version="1.1" viewbox="-0.0498162 -8.6359 9.02496 8.8423" width="9.02496pt" 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="M673 297H417L411 270C517 261 522 258 506 183L487 92C476 38 428 19 360 19C207 19 123 132 123 287C123 472 243 631 441 631C557 631 617 583 617 469L647 472C650 545 655 604 658 632C625 643 554 666 467 666C201 666 23 502 23 278C23 90 156 -16 339 -16C410 -16 501 6 569 24C566 43 567 70 573 101L589 183C604 259 607 262 667 271L673 297Z"></path></g></svg> with a vertex <svg height="9.39034pt" id="M132" style="vertical-align:-3.42943pt" version="1.1" viewbox="-0.0498162 -5.96091 7.65486 9.39034" width="7.65486pt" 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="M556 393C556 426 537 448 514 448C496 448 478 435 471 420C468 414 462 401 466 394C473 382 480 368 480 346C480 268 392 143 338 67H336C329 163 319 253 309 330S286 448 254 448C215 448 160 383 127 337L143 311C167 344 200 373 208 373S222 365 229 320C246 214 264 66 268 -20C219 -83 131 -171 17 -239L25 -261L137 -235C248 -110 273 -79 335 8C384 77 481 215 520 287C544 332 556 363 556 393Z"></path></g></svg> adjacent to one leaf.</div>

Complexity

fig5

Figure 5

Figure 5: Investigation of General Power Sum-Connectivity Index for Some Classes of Extremal Graphs 