نتایج جستجو برای: vertex
تعداد نتایج: 39591 فیلتر نتایج به سال:
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 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.
A recently published paper [T. Došlić, this journal 3 (2012) 25-34] considers the Zagreb indices of benzenoid systems, and points out their low discriminativity. We show that analogous results hold for a variety of vertex-degree-based molecular structure descriptors that are being studied in contemporary mathematical chemistry. We also show that these results are straightforwardly obtained by u...
Let be a simple graph with vertex set and edges set . A set is a dominating set if every vertex in is adjacent to at least one vertex in . An eternal 1-secure set of a graph G is defined as a dominating set such that for any positive integer k and any sequence of vertices, there exists a sequence of guards with and either or and is a dominating set. If we take a guard on every ver...
Let G be a graph with p vertices and q edges and A = {0, 1, 2, . . . , [q/2]}. A vertex labeling f : V (G) → A induces an edge labeling f∗ defined by f∗(uv) = f(u) + f(v) for all edges uv. For a ∈ A, let vf (a) be the number of vertices v with f(v) = a. A graph G is said to be vertex equitable if there exists a vertex labeling f such that for all a and b in A, |vf (a) − vf (b)| ≤ 1 and the indu...
edge distance-balanced graphs are graphs in which for every edge $e = uv$ the number of edges closer to vertex $u$ than to vertex $v$ is equal to the number of edges closer to $v$ than to $u$. in this paper, we study this property under some graph operations.
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...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید