Results 231 to 240 of about 6,277,435 (292)
Some of the next articles are maybe not open access.

Evolutionary community discovery in dynamic social networks via resistance distance

Expert systems with applications, 2021
Traditional social community discovery methods concentrate mainly on static social networks, but the analysis of dynamic networks is a prerequisite for real-time and personalized social services.
Weimin Li   +6 more
semanticscholar   +1 more source

A novel algorithm for community detection based on resistance distance and similarity

Modern physics letters B, 2021
Community detection is important for understanding the structure and function of networks. Resistance distance is a kind of distance function inherent in the network itself, which has important applications in many fields.
Pengli Lu, Zhou Yu, Yuhong Guo
semanticscholar   +1 more source

Computation of resistance distance and Kirchhoff index of the two classes of silicate networks

Applied Mathematics and Computation, 2020
The resistance distance between two vertices of a simple connected graph G is equal to the resistance between two equivalent points on an electrical network, constructed so as to correspond to G, with each edge being replaced by a unit resistor.
M. S. Sardar, Xiangfeng Pan, Si-Ao Xu
semanticscholar   +1 more source

Resistance distance local rules

Journal of Mathematical Chemistry, 2007
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chen, HY, Zhang, FJ
openaire   +2 more sources

Resistance distance, closeness, and betweenness

Social Networks, 2013
Abstract In a seminal paper Stephenson and Zelen (1989) rethought centrality in networks proposing an information-theoretic distance measure among nodes in a network. The suggested information distance diverges from the classical geodesic metric since it is sensible to all paths (not just to the shortest ones) and it diminishes as soon as there are
BOZZO, Enrico, FRANCESCHET, Massimo
openaire   +1 more source

Resistance distances in composite graphs

Journal of Physics A: Mathematical and Theoretical, 2014
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. Let + G H, G× H, G H [ ], ⊗ G H, ⊠ G H, ∘ GH and G H {} be the join, product, composition, direct product, strong product, corona ...
Yujun Yang, Douglas J Klein
openaire   +1 more source

Resistance distance in regular graphs

International journal of quantum chemistry, 1999
This report considers the resistance distance as a recently proposed new intrinsic metric on (molecular) graphs, and in particular, the sum R over resistance distances between all pairs of vertices is considered as a graph invariant. It has been proved that R(G(N)) > R(K-N), where G(N) denotes a connected graph containing N vertices and K-N denotes
Trinajstić, Nenad, Nikolić, Sonja
openaire   +3 more sources

Resistance distance and Laplacian spectrum

Theoretical Chemistry Accounts: Theory, Computation, and Modeling (Theoretica Chimica Acta), 2003
The resistance distance r ij between two vertices v i and v j of a (connected, molecular) graph G is equal to the resistance between the respective two points of an electrical ...
Xiao, WJ, Gutman, I
openaire   +2 more sources

A novel longitudinal connectivity index to evaluate reticular river networks based on the combination of network maximum flow and resistance distance.

Journal of Environmental Management
Reticular river networks, essential for ecosystems and hydrology, pose challenges in assessing longitudinal connectivity due to complex multi-path structures and variable flows, exacerbated by human-made infrastructures like sluices.
Shanheng Huang   +3 more
semanticscholar   +1 more source

Resistance distance and sharp bounds of two-mode electrical networks

Physica Scripta
Electrical networks are ubiquitous in our daily lives, ranging from small integrated circuits to large-scale power systems. These networks can be easily represented as graphs, where edges represent connections and vertices represent electric nodes.
Asad Ullah, S. Salman, Shahid Zaman
semanticscholar   +1 more source

Home - About - Disclaimer - Privacy