Results 31 to 40 of about 4,242,053 (289)
Formulation of tunneling resistance between neighboring carbon nanotubes in polymer nanocomposites
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
Resistance Training for Distance Running [PDF]
The positive effects of resistance training on distance-running performance through enhanced running economy are well established. However, few practical recommendations exist to aid coaches in planning resistance training to supplement a distance-running program.
Jones, Paul, Bampouras, Theodoros M.
openaire +1 more source
The Resistance Distance and Kirchhoff Index on Quadrilateral Graph and Pentagonal Graph
The quadrilateral graph Q(G) is obtained from G by replacing each edge in G with two parallel paths of length 1 and 3, whereas the pentagonal graph W(G) is obtained from G by replacing each edge in G with two parallel paths of length 1 and 4.
Qun Liu
doaj +1 more source
Efficient Point-to-Point Resistance Distance Queries in Large Graphs
We describe a method to efficiently compute point-to-point resistance distances in a graph, which are notoriously difficult to compute from the raw graph data.
Craig Gotsman, Kai Hormann
doaj +1 more source
Resistance Distance in H-Join of Graphs G1,G2,…,Gk
In view of the wide application of resistance distance, the computation of resistance distance in various graphs becomes one of the main topics. In this paper, we aim to compute resistance distance in H-join of graphs G 1 , G 2 , … , G k
Li Zhang +3 more
doaj +1 more source
The resistance distance is widely used in random walk, electronic engineering, and complex networks. One of the main topics in the study of the resistance distance is the computation problem.
Qun Liu, Jia-Bao Liu, Shaohui Wang
doaj +1 more source
Bicyclic Graphs with the Second-Maximum and Third-Maximum Degree Resistance Distance
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
Antimicrobial resistance surveillance in Europe 2013: Annual Report of the European Antimicrobial Resistance Surveillance Network (EARS-Net) [PDF]
Portugal - EARS-Net Management Team & National representatives of EARS-Net (Manuela Caniça, José Artur Paiva, Vera Manageiro, Eugénia Ferreira)The results presented in this report are based on antimicrobial resistance data from invasive isolates reported
European Antimicrobial Resistance Surveillance Network (EARS-Net)
core +1 more source
Maximum Reciprocal Degree Resistance Distance Index of Bicyclic Graphs
The reciprocal degree resistance distance index of a connected graph G is defined as RDRG=∑u,v⊆VGdGu+dGv/rGu,v, where rGu,v is the resistance distance between vertices u and v in G. Let ℬn denote the set of bicyclic graphs without common edges and with n
Gaixiang Cai, Xing-Xing Li, Guidong Yu
doaj +1 more source
Further Results on the Resistance-Harary Index of Unicyclic Graphs
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

