On Sum Degree-Based Topological Indices of Some Connected Graphs

<div>Edge partition of third type of Dominating David Derived network <svg height="12.5794pt" id="M205" style="vertical-align:-3.29107pt" version="1.1" viewbox="-0.0498162 -9.28833 37.4853 12.5794" width="37.4853pt" 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="M300 -147C201 -63 143 98 143 270S200 602 300 686L282 710C136 610 70 450 70 271V270C70 89 136 -72 282 -170L300 -147Z"></path></g><g transform="matrix(.013,0,0,-0.013,4.498,0)"><path d="M743 375C743 570 607 650 407 650H136L130 622C214 612 220 606 204 526L125 122C110 43 105 36 24 27L17 0H250C382 0 482 23 571 76C680 141 743 248 743 375ZM644 379C644 188 520 36 305 36C277 36 249 38 229 46C205 55 202 71 212 126L293 553C300 588 306 600 317 606C330 613 356 617 390 617C547 617 644 537 644 379Z"></path></g><g transform="matrix(.0091,0,0,-0.0091,14.391,3.132)"><path d="M290 377C321 398 342 415 358 430C378 450 389 473 389 502C389 578 329 635 238 635H237C184 635 137 610 109 578L64 515L88 493C112 529 154 573 208 573S303 542 303 482C303 409 233 370 141 341L149 308C165 313 190 319 215 319C272 319 341 283 341 193C342 98 292 43 222 43C163 43 122 72 96 94C88 101 79 100 70 94C61 87 47 73 46 60C44 47 48 37 62 23C76 10 118 -12 165 -12C238 -12 430 62 430 223C430 297 379 359 290 375V377Z"></path></g><g transform="matrix(.013,0,0,-0.013,19.337,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"></path></g><g transform="matrix(.013,0,0,-0.013,23.835,0)"><path d="M324 430H196L233 583L223 592L145 529L120 430H54L29 396L31 388H111L56 126C33 15 54 -12 77 -12C137 -12 214 57 250 95L233 119C208 92 155 59 138 59C126 59 120 70 131 125L186 390L298 394L324 430Z"></path></g><g transform="matrix(.013,0,0,-0.013,28.269,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"></path></g><g transform="matrix(.013,0,0,-0.013,32.767,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"></path></g></svg> based on sum of degrees of end vertices of each edge.</div>

Mathematical Problems in Engineering

tab3

Table 3

Table 3: On Sum Degree-Based Topological Indices of Some Connected Graphs 