Let D be a digraph with vertex set V(D) .For vertex v V(D), the degree of v, denoted by d(v), is defined as the minimum value if its out-degree  and its in-degree . Now let D be a digraph with minimum degree  and edge-connectivity If  is real number, then the zeroth-order general Randic index is defined by   .  A digraph is maximally edge-connected if . In this paper we present sufficient condi...

Let G and H be connected graphs. The tensor product G + H is a graph with vertex set V(G+H) = V (G) X V(H) and edge set E(G + H) ={(a , b)(x , y)| ax ∈ E(G) & by ∈ E(H)}. The graph H is called the strongly triangular if for every vertex u and v there exists a vertex w adjacent to both of them. In this article the tensor product of G + H under some distancebased topological indices are investiga...

let g and h be two graphs. the corona product g o h is obtained by taking one copy of gand |v(g)| copies of h; and by joining each vertex of the i-th copy of h to the i-th vertex of g,i = 1, 2, …, |v(g)|. in this paper, we compute pi and hyper–wiener indices of the coronaproduct of graphs.

the geometric-arithmetic index is another topological index was defined as2 deg ( )deg ( )( )deg ( ) deg ( )g guv eg gu vga gu v  , in which degree of vertex u denoted by degg (u). wenow define a new version of ga index as 4( )2 ε ( )ε ( )( )ε ( ) ε ( )g ge uv e g g gu vga g  u v , where εg(u) isthe eccentricity of vertex u. in this paper we compute this new topological index for twogr...

let $d$ be a digraph with vertex set $v(d)$. for vertex $vin v(d)$, the degree of $v$,denoted by $d(v)$, is defined as the minimum value if its out-degree and its in-degree.now let $d$ be a digraph with minimum degree $deltage 1$ and edge-connectivity$lambda$. if $alpha$ is real number, then the zeroth-order general randic index is definedby $sum_{xin v(d)}(d(x))^{alpha}$. a digraph is maximall...

The Sombor index is one of the geometry-based descriptors, which was defined as $$\begin{aligned} SO(G)=\sum _{uv\in E(G)}\sqrt{d^{2}_{u}+d^{2}_{v}}, \end{aligned}$$ where $$d_{u}$$ (resp. $$d_{v}$$ ) denotes degree vertex u v) in G. In this note, we determine graphs among set with connectivity edge connectivity) at most k having maximum and minimum indices, solves an open problem on proposed b...

The degree distance index (DDI) is a vertex-degree weighted version of well-known that called by Wiener (WI). In extremal theory graphs, improving the bounds with best possible values worth investigating problem. this note, exact formulae DDI for four different types sum graphs in terms various indic...