Computing Bounds for General Randic Coindex of Sum Graphs

<div>Graph <svg height="11.8174pt" id="M75" style="vertical-align:-3.1815pt" version="1.1" viewbox="-0.0498162 -8.6359 11.727 11.8174" width="11.727pt" 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="M600 480C600 590 528 650 384 650H143L137 622C222 614 225 607 210 531L130 127C113 41 106 36 23 28L17 0H294L300 28C204 36 195 42 212 127L243 284L314 263C327 263 339 263 352 264C465 271 600 337 600 480ZM508 481C508 351 402 304 329 304C289 304 265 311 250 317L295 559C302 594 310 606 323 611C335 616 350 619 367 619C455 619 508 573 508 481Z"></path></g><g transform="matrix(.0091,0,0,-0.0091,6.656,3.132)"><path d="M462 177V227H365V632H320C217 496 116 350 21 208V177H284V109C284 43 280 38 190 31V0H451V31C369 38 365 43 365 108V177H462ZM284 227H88C155 336 218 430 282 519H284V227Z"></path></g></svg> and its subdivision.</div>

Journal of Mathematics

Computing Bounds for General Randic Coindex of Sum Graphs

Figure 1