نتایج جستجو برای: edge reversewiener indices
تعداد نتایج: 194233 فیلتر نتایج به سال:
The recent interest in network analysis applications in personality psychology and psychopathology has put forward new methodological challenges. Personality and psychopathology networks are typically based on correlation matrices and therefore include both positive and negative edge signs. However, some applications of network analysis disregard negative edges, such as computing clustering coe...
We develop a formalism to estimate, simultaneously, the usual bulk and edge indices from topological insulators in case of finite sample with open boundary conditions provide physical interpretation these quantities. then show that they converge exponentially fast an integer value when we increase system size also index estimates coincide at size. The theorem applies any non-homogeneous system,...
Remote sensing-based woody biomass quantification in sparsely-vegetated areas is often limited when using only common broadband vegetation indices as input data for correlation with ground-based measured biomass information. Red edge indices and texture attributes are often suggested as a means to overcome this issue. However, clear recommendations on the suitability of specific proxies to prov...
Let $G$ and $H$ be graphs. The tensor product $Gotimes H$ of $G$ and $H$ has vertex set $V(Gotimes H)=V(G)times V(H)$ and edge set $E(Gotimes H)={(a,b)(c,d)| acin E(G):: and:: bdin E(H)}$. In this paper, some results on this product are obtained by which it is possible to compute the Wiener and Hyper Wiener indices of $K_n otimes G$.
Novel bond-level molecular descriptors based on linear maps similar to those defined in algebra theory are proposed. The k edge-adjacency matrix (E) denotes the matrix of bond linear indices (non-stochastic) with respect to the canonical basis set. The k stochastic edge-adjacency matrix, ES, is here proposed as a new molecular representation easily calculated from E. Then, the k stochastic bond...
The reformulated Zagreb indices of a graph is obtained from the classical Zagreb by replacing vertex degree by edge degree and are defined as sum of squares of the degree of the edges and sum of product of the degrees of the adjacent edges. In this paper we give some explicit results for calculating the first and second reformulated Zagreb indices of dendrimers. Mathematics Subject Classificati...
Respiratory sinus arrhythmia (RSA) is a cyclical variation in heart rate during breathing, where the heart rate increases during inspiration and decreases during expiration. RSA and the electroencephalogram (EEG) were monitored in 10 patients undergoing elective surgery with isoflurane and nitrous oxide in oxygen anaesthesia after induction with propofol. All patients were subject to controlled...
Understanding the development of landscape patterns over broad spatial and temporal scales is a major contribution to ecological sciences and is a critical area of research for forested land management. Boreal forests represent an excellent case study for such research because these forests have undergone significant changes over recent decades. We analyzed the temporal trends of four widely-us...
Let G = (V,E) be a simple graph. An edge labeling f : E → {0, 1} induces a vertex labeling f : V → Z2 defined by f(v) ≡ ∑ uv∈E f(uv) (mod 2) for each v ∈ V , where Z2 = {0, 1} is the additive group of order 2. For i ∈ {0, 1}, let ef (i) = |f−1(i)| and vf (i) = |(f+)−1(i)|. A labeling f is called edge-friendly if |ef (1) − ef (0)| ≤ 1. If (G) = vf (1) − vf (0) is called the edge-friendly index o...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید