نتایج جستجو برای: albertson estrada index
تعداد نتایج: 396903 فیلتر نتایج به سال:
The notion of strongly quotient graph (SQG) was introduced by Adiga et al. (2007). In this paper, we obtain some better results for the distance energy and the distance Estrada index of any connected strongly quotient graph (CSQG) as well as some relations between the distance Estrada index and the distance energy. We also present some bounds for the distance energy and the distance Estrada ind...
Let G be a simple connected graph on n vertices and λ1, λ2, . . . , λn be the eigenvalues of the adjacency matrix of G. The Estrada index of G is defined as EE(G) = Σ i=1 ei . A cactus is a connected graph in which any two cycles have at most one common vertex. In this work, the unique graph with maximal Estrada index in the class of all cacti with n vertices and k cycles was determined. Also, ...
Let G be a simple graph with eigenvalues λ1, λ2, . . . , λn. The Estrada index of G is defined as EE(G) = ∑ n i=1 ei . In this paper, the unique graph with maximum Estrada index is determined among connected graphs with given numbers of vertices and cut edges.
For a simple hypergraph H on n vertices, its Estrada index is defined as [Formula in text], where λ 1, λ 2,…, λ n are the eigenvalues of its adjacency matrix. In this paper, we determine the unique 3-uniform linear hypertree with the maximum Estrada index.
Let G be a simple graph with eigenvalues λ1, λ2, . . . , λn. The Estrada index of G is defined as EE(G) = ∑ n i=1 ei . In this paper, the unique graph with maximum Estrada index is determined among connected graphs with given numbers of vertices and cut edges.
Several hundreds of so-called molecular structuredescriptors were proposed in the chemical literature [1] and are used for modeling of various physical and chemical properties of (mainly) organicmolecules. In general, a molecular structure-descriptor is a number, usually computed from the molecular graph [2, 3], that reflects certain topological features [4, 5] of the underlying molecule. Many ...
Let λ1, λ2, · · · , λn be the eigenvalues of the distance matrix of a connected graph G. The distance Estrada index of G is defined as DEE(G) = ∑ n i=1 ei . In this note, we present new lower and upper bounds for DEE(G). In addition, a Nordhaus-Gaddum type inequality for DEE(G) is given. MSC 2010: 05C12, 15A42.
The Estrada index was used to study the folding degree of proteins and other long-chain molecules [4, 5, 6, 9]. It also has numerous applications in the vast field of complex networks [7, 8, 13, 14, 17]. A number of properties especially lower and upper bounds [3, 10, 11, 12, 15, 16, 18, 19, 20] for the Estrada index are known. In this paper, we establish further lower bounds improving some res...
Let G be a simple connected graph on n vertices and λ1, λ2, . . . , λn be the eigenvalues of the adjacency matrix of G. The Estrada index of G is defined as EE(G) = n i=1 e λi . LetTn be the class of tricyclic graphs G on n vertices. In this paper, the graphs inTn with themaximal Estrada index is characterized. © 2013 Elsevier B.V. All rights reserved.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید