Analysis of Complex Networks via Some Novel Topological Indices

<div>Edge partitioning depends on the degree of the end vertices of <span class="nowrap"><svg height="12.2532pt" id="M121" style="vertical-align:-3.29108pt" version="1.1" viewbox="-0.0498162 -8.96212 10.9702 12.2532" width="10.9702pt" 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"></path></g><g transform="matrix(.0091,0,0,-0.0091,7.176,3.132)"><path d="M329 433H203L239 587L230 596L147 534L123 433H57L30 395L34 388H115L61 129C37 16 59 -12 85 -12C147 -12 222 58 260 98L241 125C212 95 160 62 144 62C132 62 127 71 138 126L192 386L305 394L329 433Z"></path></g></svg>.</span></div>

Mathematical Problems in Engineering

tab3

Table 3

Table 3: Analysis of Complex Networks via Some Novel Topological Indices 