The concept of Sombor index was recently introduced by Gutman in the chemical graph theory. It is a vertex-degree-based topological index and is denoted by Sombor index : where is the degree of vertex in G. Here, we present novel lower and upper bounds on the Sombor index of graphs by using some graph parameters. Moreover, we obtain several relations on Sombor index with the first and second Zagreb indices of graphs. Finally, we give some conclusions and propose future work.
1 January 2016 in Analele ştiinţifice ale Universităţii "Ovidius" Constanţa. Seria Matematică
For a (molecular) graph G with vertex set V (G) and edge set E(G), the first Zagreb index of G is defined as , where d G (v i ) is the degree of vertex vi in G. Recently Xu et al. introduced two graphical invariants and named as first multiplicative Zagreb coindex and second multiplicative Zagreb coindex, respectively. The Narumi-Katayama index of a graph G, denoted by NK(G), is equal to the product of the degrees of the vertices of G, that is, NK(G) = . The irregularity index t(G) of G is defined as the number of distinct terms in the degree sequence of G. In this paper, we give some lower and upper bounds on the first Zagreb index M1(G) of graphs and trees in terms of number of vertices, irregularity index, maxi- mum degree, and characterize the extremal graphs. Moreover, we obtain some lower and upper bounds on the (first and second) multiplicative Zagreb coindices of graphs and characterize the extremal graphs. Finally, we present some relations between first Zagreb index and Narumi-Katayama index, and (first and second) multiplicative Zagreb index and coindices of graphs.
Apart from its applications in Chemistry, Biology, Physics, Social Sciences, Anthropology, etc., there are close relations between graph theory and other areas of Mathematics. Fibonacci numbers are of utmost interest due to their relation with the golden ratio and also due to many applications in different areas from Biology, Architecture, Anatomy to Finance. In this paper, we define Fibonacci graphs as graphs having degree sequence consisting of n consecutive Fibonacci numbers and use the invariant to obtain some more information on these graphs. We give the necessary and sufficient conditions for the realizability of a set D of n successive Fibonacci numbers for every n and also list all possible realizations called Fibonacci graphs for .
1 February 2014 in Linear Algebra and its Applications