Results 11 to 20 of about 1,089,730 (251)
Degree resistance distance of unicyclic graphs [PDF]
Transactions on Combinatorics, 2012 Let G be a connected graph with vertex set V(G). The degree resistance distance of G is defined as the sum over all pairs of vertices of the terms [d(u)+d(v)] R(u,v), where d(u) is the degree of vertex u, and R(u,v) denotes the resistance distance ...
Ivan Gutman, Linhua Feng, Guihai Yu
doaj +2 more sources
The degree resistance distance of cacti
Discrete Applied Mathematics, 2015 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Du, Junfeng +3 more
openaire +4 more sources
On degree resistance distance of cacti
Discrete Applied Mathematics, 2016 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jia-Bao Liu +3 more
openaire +3 more sources
STUDY OF PHENOTYPIC VARIABILITY USING THE VARIETAL DIVERSITY OF CULTIVATED FORMS OF NAKED AND HULLED OATS IN THE INTERCROPPING SYSTEM [PDF]
Journal of Applied Life Sciences and Environment, 2022 The research carried out at the Gene Bank in Suceava, Northern Romania, aimed to highlight the phenotypic variability of the germplasm of Avena spp. For this purpose, the morpho-productive traits and resistance to diseases, pests and weeds were analysed.
Domnica PLĂCINTĂ, Danela MURARIU
doaj +1 more source
Resistance Distances and Kirchhoff Indices Under Graph Operations
IEEE Access, 2020 The resistance distance between any two vertices of a connected graph $G$ is defined as the net effective resistance between them in the electrical network constructed from $G$ by replacing each edge with a unit resistor. The Kirchhoff index of $G$
Yujun Yang, Yue Yu
doaj +1 more source
Resistance distance, information centrality, node vulnerability and vibrations in complex networks [PDF]
, 2010 We discuss three seemingly unrelated quantities that have been introduced in different fields of science for complex networks. The three quantities are the resistance distance, the information centrality and the node displacement.
A.A. Dobrynin +35 more
core +1 more source
Estimating Robustness Through Kirchhoff Index in Mesh Graphs
IEEE Access, 2020 The Kirchhoff index is a new measure of network robustness. In this paper, we study the robustness of $n \times m$ mesh graphes (denoted by $M_{n\times m}$ ) by determining the most important edges and the least important edges. In other words, we aim
Yuming Peng, Jianyao Li, Weihua He
doaj +1 more source
Effective resistances and Kirchhoff index in subdivision networks [PDF]
, 2016 We define a subdivision network ¿S of a given network ¿; by inserting a new vertex in every edge, so that each edge is replaced by two new edges with conductances that fulfill electrical conditions on the new network.
Carmona Mejías, Ángeles +2 more
core +2 more sources
The Extremal Cacti on Multiplicative Degree-Kirchhoff Index
Mathematics, 2019 For a graph G, the resistance distance r G ( x , y ) is defined to be the effective resistance between vertices x and y, the multiplicative degree-Kirchhoff index R ∗ ( G ) = ∑ { x , y } ⊂ V ( G ) d G ( x ) d G
Fangguo He, Zhongxun Zhu
doaj +1 more source
Developments in the theory of randomized shortest paths with a comparison of graph node distances [PDF]
, 2013 There have lately been several suggestions for parametrized distances on a graph that generalize the shortest path distance and the commute time or resistance distance.
Kivimäki, Ilkka +2 more
core +2 more sources