In this paper, the Hyper - Zagreb index of the Cartesian product, composition and corona product of graphs are computed. These corrects some errors in G. H. Shirdel et al.[11].

‎Let G=(V(G),E(G)) be a simple connected graph with vertex set V(G) and edge‎ ‎set E(G)‎. ‎The (first) edge-hyper Wiener index of the graph G is defined as‎: ‎$$WW_{e}(G)=sum_{{f,g}subseteq E(G)}(d_{e}(f,g|G)+d_{e}^{2}(f,g|G))=frac{1}{2}sum_{fin E(G)}(d_{e}(f|G)+d^{2}_{e}(f|G)),$$‎ ‎where de(f,g|G) denotes the distance between the edges f=xy and g=uv in E(G) and de(f|G)=∑g€(G)de(f,g|G). ‎In thi...

‎For a simple graph $G$‎, ‎the signless Laplacian Estrada index is defined as $SLEE(G)=sum^{n}_{i=1}e^{q^{}_i}$‎, ‎where $q^{}_1‎, ‎q^{}_2‎, ‎dots‎, ‎q^{}_n$ are the eigenvalues of the signless Laplacian matrix of $G$‎. ‎In this paper‎, ‎we first characterize the unicyclic graphs with the first two largest and smallest $SLEE$'s and then determine the unique unicyclic graph with maximum $SLEE$ a...

‎Let $G$ be a graph of order $n$ with vertices labeled as $v_1‎, ‎v_2,dots‎ , ‎v_n$‎. ‎Let $d_i$ be the degree of the vertex $v_i$ for $i = 1‎, ‎2‎, ‎cdots‎ , ‎n$‎. ‎The Albertson matrix of $G$ is the square matrix of order $n$ whose $(i‎, ‎j)$-entry is equal to $|d_i‎ - ‎d_j|$ if $v_i $ is adjacent to $v_j$ and zero‎, ‎otherwise‎. ‎The main purposes of this paper is to introduce the Albertson ...

The sum of distances between all the pairs of vertices in a connected graph is known as the {it Wiener index} of the graph. In this paper, we obtain the Wiener index of edge complements of stars, complete subgraphs and cycles in $K_n$.