Related papers: Degree sequence of the generalized Sierpinski grap…

In the last forty years, many scientists used graph theory to develop mathematical models for analyzing structures and properties of various chemical compounds. In this paper, we will establish formulas and bounds for generalized first…

For a simple graph, we introduce a notion of the star sequence and prove that the star sequence and the frequently sequences of a graph are inverses of each other from a combinatorial point of view. As a consequence, we express the general…

In this paper, we examine a specific type of random chains and propose an unified approach to studying the degree-based topological indices, including their extreme values. We derive explicit analytical expressions for the expected values…

Let ${\mathcal G}_n$ be the set of class of graphs of order $n$. The first Zagreb index $M_1(G)$ is equal to the sum of squares of the degrees of the vertices, and the second Zagreb index $M_2(G)$ is equal to the sum of the products of the…

For a simple graph we introduce notions of the double star sequence, the double star frequently sequence and prove that these sequences are inverses of each other. As a consequence, we express the general second Zagreb index in terms of the…

For a simple graph $G$ with $n$ vertices and $m$ edges, the first Zagreb index and the second Zagreb index are defined as $M_1(G)=\sum_{v\in V}d(v)^2 $ and $M_2(G)=\sum_{uv\in E}d(u)d(v)$. In \cite{VGFAD}, it was shown that if a connected…

The second Zagreb index of a graph G is denoted by $M_2(G)=\sum_{uv\in E(G)}d(u)d(v)$. In this paper, we investigate properties of the extremal graphs with the maximum second Zagreb indices with given graphic sequences, in particular…

Making use of a majorization technique for a suitable class of graphs, we derive upper and lower bounds for some topological indices depending on the degree sequence over all vertices, namely the first general Zagreb index and the first…

The first Zagreb index of a graph $G$ is the sum of the square of every vertex degree, while the second Zagreb index is the sum of the product of vertex degrees of each edge over all edges. In our work, we solve an open question about…

Let $G = (V, E)$ be a graph. The first Zagreb index of a graph $G$ is defined as $\sum_{u \in V} d^2(u)$, where $d(u)$ is the degree of vertex $u$ in $G$. Using the P\'{o}lya-Szeg\H{o} inequality, we in this paper present the first Zagreb…

Let $G=(V,E)$ be a graph with $n$ vertices and $m$ edges. The hyper Zagreb index of $G$, denoted by $HM(G)$, is defined as $HM(G) =\sum\limits_{uv \in E(G)}\left[d_{G}(u)+d_G(v)\right]^{2}$ where $d_G(v)$ denotes the degree of a vertex $v$…

The first Zagreb index $M_{1}$ of a graph is defined as the sum of the square of every vertex degree, and the second Zagreb index $M_{2}$ of a graph is defined as the sum of the product of vertex degrees of each pair of adjacent vertices.…

The first Zagreb index of a graph $G$ is the sum of squares of the vertex degrees in a graph and the second Zagreb index of $G$ is the sum of products of degrees of adjacent vertices in $G$. The imbalance of an edge in $G$ is the numerical…

The generalized hierarchical product of graphs was introduced by L. Barri\'ere et al in 2009. In this paper, reformulated first Zagreb index of generalized hierarchical product of two connected graphs and hence as a special case cluster…

WE study the clique number and the chromatic number of generalized Sierpinski graphs in which the base graph is an arbitrary simple graph.

The hyper Zagreb index is a kind of extensions of Zagreb index, used for predicting physicochemical properties of organic compounds. Given a graph $G= (V(G), E(G))$, the first hyper-Zagreb index is the sum of the square of edge degree over…

Let $D=(V,A)$ be a digraphs without isolated vertices. The first Zagreb index of a digraph $D$ defined as a summation over all arcs, $M_1(D)=\frac{1}{2}\sum\limits_{uv\in A}(d^{+}_{u}+d^{-}_v)$, where $d^{+}_u$(resp. $d^{-}_u$) denotes the…

In this paper we obtain closed formulae for several parameters of generalized Sierpi\'{n}ski graphs $S(G,t)$ in terms of parameters of the base graph $G$. In particular, we focus on the chromatic, vertex cover, clique and domination…

This paper presents new lower bounds for the first general Zagreb index $Z_{\alpha}(G)$ involving two, three, and four arbitrary degrees of vertices of a simple graph $G$. For the special cases $\alpha = 2$ and $\alpha = -2$, the results…

The first Zagreb index $M_{1}(G)$ is equal to the sum of squares of the degrees of the vertices, and the second Zagreb index $M_{2}(G)$ is equal to the sum of the products of the degrees of pairs of adjacent vertices of the underlying…