ABSTRACT: Let G=( V,E ) be a graph. The first Zagreb index of a graph G is defined as ∑ u∈V d G 2 ( u ) , where d G ( u ) is the degree of vertex u in G . In this paper, we obtain two lower bounds ...
and put them all in the right places. We use Sphinx and the Read the Docs theme to generate the HTML and PDF versions of the textbook. Finally, we use another script to deploy the contents to the user ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback