نتایج جستجو برای: sum eccentricity eigenvalues
تعداد نتایج: 101250 فیلتر نتایج به سال:
Let G = (V,E) be a simple connected graph. The eccentric-distance sum of G is defined as ξ(G) = ∑ {u,v}⊆V (G) [e(u) + e(v)]d(u, v), where e(u) is the eccentricity of the vertex u in G and d(u, v) is the distance between u and v. In this paper, we establish formulae to calculate the eccentric-distance sum for some graphs, namely wheel, star, broom, lollipop, double star, friendship, multi-star g...
in this study, the effective parameters on the inelastic response of asymmetric buildings is evaluated for an ensemble of real iranian earthquake records by considering soil-structure interaction. then, the design eccentricity obtained from the inelastic dynamic soil-structure analysis is compared with the design eccentricity of seisimic codes of iran, atc-3, new zeland, canada, mexico, austral...
Abstract. In this paper the idea of sum distance which is a metric, in a fuzzy graph is introduced. The concepts of eccentricity, radius, diameter, center and self centered fuzzy graphs are studied using this metric. Some properties of eccentric nodes, peripheral nodes and central nodes are obtained. A characterization of self centered complete fuzzy graph is obtained and conditions under which...
Let G be a simple graph and let its vertex set be V (G) = {v1, v2, ..., vn}. The adjacency matrix A(G) of the graph G is a square matrix of order n whose (i, j)-entry is equal to unity if the vertices vi and vj are adjacent, and is equal to zero otherwise. The eigenvalues λ1, λ2, ..., λn of A(G), assumed in non increasing order, are the eigenvalues of the graph G. The energy of G was first defi...
• Introduce several new distance-based global and local functions based the smallest distance which are related to eccentricity, center, sum of eccentricities in graphs trees. The values acompared with some sharp bounds established. difference between eccentricity uniformity behaves a very similar way as itself. Motivated from study trees, we introduce on vertex leaf (called “uniformity” at tha...
The D-eigenvalues {μ1, μ2, . . . , μn} of a graph G are the eigenvalues of its distance matrix D and form the D-spectrum of G denoted by specD(G) . The D-energy ED(G) of the graph G is the sum of the absolute values of its D-eigenvalues. We describe here the distance spectrum of some self-complementary graphs in the terms of their adjacency spectrum. These results are used to show that there ex...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید