Results 31 to 40 of about 6,263,611 (271)
Resistance Distance in the Double Corona Based on R-Graph
Mathematics, 2019 Let G 0 be a connected graph on n vertices and m edges. The R-graph R ( G 0 ) of G 0 is a graph obtained from G 0 by adding a new vertex corresponding to each edge of G 0 and by joining each new vertex to the end
Li Zhang +3 more
doaj +1 more source
Individual resistance to difficulties during distance learning
Вестник Мининского университета, 2021 Introduction. The pandemic situation, the rapid transition to distance learning forms - all this was a serious test for participants in the educational environment.
N. I. Dunaeva, P. A. Egorova
doaj +1 more source
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
Formulation of tunneling resistance between neighboring carbon nanotubes in polymer nanocomposites
Engineering Science and Technology, an International Journal, 2021 We aim to express the tunneling resistance in polymer nanocomposites by carbon nanotube (CNT) concentration, interphase depth, CNT curliness, tunneling distance, interfacial tension, network portion and CNT size.
Yasser Zare, Kyong Yop Rhee
doaj +1 more source
On the resistance distance and Kirchhoff index of a linear hexagonal (cylinder) chain [PDF]
Physica A: Statistical Mechanics and its Applications, 2019 The resistance between two nodes in some resistor networks has been studied extensively by mathematicians and physicists. Let L n be a linear hexagonal chain with n 6-cycles.
Sumin Huang, Shuchao Li
semanticscholar +1 more source
Further Results on the Resistance-Harary Index of Unicyclic Graphs
Mathematics, 2019 The Resistance-Harary index of a connected graph G is defined as R H ( G ) = ∑ { u , v } ⊆ V ( G ) 1 r ( u , v ) , where r ( u , v ) is the resistance distance between vertices u and v in G.
Jian Lu +4 more
doaj +1 more source
Theoretical and Computational Methods to Resistance Distances in Novel Graphs Operations
IEEE Access, 2019 Motivated by the recent research on the computation of resistance distance, this paper aims to compute resistance distance in two classes of graphs, which are generated by three graphs.
Li Zhang, Jia-Bao Liu
doaj +1 more source
IEEE Access, 2019 Let G be a connected graph. The subdivision graph S(G) of a graph (G) is the graph obtained by inserting a new vertex into every edge of G. The set of such new vertices is denoted by I(G).
Qun Liu
doaj +1 more source
Bicyclic Graphs with the Second-Maximum and Third-Maximum Degree Resistance Distance
Journal of Mathematics, 2021 Let G=V,E be a connected graph. The resistance distance between two vertices u and v in G, denoted by RGu,v, is the effective resistance between them if each edge of G is assumed to be a unit resistor.
Wenjie Ning, Kun Wang, Hassan Raza
doaj +1 more source
Resistance distance in connected balanced digraphs
Discrete Applied Mathematics, 2023 Let $D = (V, E)$ be a strongly connected and balanced digraph with vertex set $V$ and arc set $E.$ The classical distance $d_{ij}^D$ from $i$ to $j$ in $D$ is the length of a shortest directed path from $i$ to $j$ in $D.$ Let $L$ be the Laplacian matrix of $D$ and $ L^{\dagger} = ( l_{ij}^{\dagger} )$ be the Moore-Penrose inverse of $L.$ The resistance
Balakrishnan, R. +2 more
openaire +3 more sources