نتایج جستجو برای: resistance distance in graphs

تعداد نتایج: 17088695  

Journal: :Computational Geometry: Theory and Applications 2021

We introduce new distance measures for comparing straight-line embedded graphs based on the Fréchet and weak distance. These graph distances are defined using continuous mappings thus take combinatorial structure as well geometric embeddings of into account. present a general algorithmic approach computing these distances. Although we show that deciding is NP-hard graphs, prove our yields polyn...

Journal: :Discrete Applied Mathematics 2021

A perfect matching in a graph G is set of nonadjacent edges covering every vertex G. Motivated by recent progress on the relations between eigenvalues and number graph, this paper, we aim to present distance spectral radius condition guarantee existence matching. Let be an n-vertex connected where n even λ1(D(G)) Then following statements are true. (I) If 4≤n≤8 λ1(DG)≤λ1(D(Sn,n2−1)), then conta...

Journal: :Siam Review 2022

We develop a theory to measure the variance and covariance of probability distributions defined on nodes graph, which takes into account distance between nodes. Our approach generalizes usual (co)variance setting weighted graphs retains many its intuitive desired properties. Interestingly, we find that number famous concepts in graph network science can be reinterpreted this as variances covari...

Journal: :Discrete Mathematics 2008

Journal: :Journal of the Indonesian Mathematical Society 2012

Journal: :Journal of algebra combinatorics discrete structures and applications 2021

We generalize several topological indices and introduce the general degree distance of a connected graph $G$. For $a, b \in \mathbb{R}$, $DD_{a,b} (G) = \sum_{ v V(G)} [deg_{G}(v)]^a S^b_{G} (v)$, where $V(G)$ is vertex set $G$, $deg_G (v)$ $v$, $S^b_{G} (v) w V(G) \setminus \{ \} } [d_{G} (v,w) ]^{b}$ $d_{G} (v,w)$ between $v$ $w$ in present some sharp bounds on for multipartite graphs trees g...

2016
Qun Liu

The resistance distance between any two vertices of a connected graph is defined as the effective resistance between them in the electrical network constructed from the graph by replacing each edge with a (unit) resistor. The Kirchhoff index Kf(G) is the sum of resistance distances between all pairs of vertices in G. For a graph G, let R(G) be the graph obtained from G by adding a new vertex co...

Journal: :Czechoslovak Mathematical Journal 2015

Journal: :Discrete Mathematics 2010

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید