Optimizing Wiener and Randić Indices of Graphs

<div>Line graph of <svg height="11.8174pt" id="M96" style="vertical-align:-3.1815pt" version="1.1" viewbox="-0.0498162 -8.6359 13.9062 11.8174" width="13.9062pt" 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><g transform="matrix(.0091,0,0,-0.0091,8.827,3.132)"><path d="M389 0V32C297 38 291 46 291 118V635C234 613 175 595 109 583V556L161 554C203 552 207 547 207 497V118C207 46 201 38 110 32V0H389Z"></path></g></svg> and classification of the edge sets into equivalence classes for the graphs in Figure <a href="../fig1/">1</a>. (a) <i>G</i><sub>1</sub>. (b) <i>G</i><sub>2</sub>. (c) <i>G</i><sub>3</sub>.</div>

Advances in Operations Research

Optimizing Wiener and Randić Indices of Graphs

Figure 3