Comparative results between the number of subtrees and Wiener index of graphs
Work
Year: 2022
Type: article
Abstract: For a graph G , we denote by N ( G ) the number of non-empty subtrees of G . If G is connected, its Wiener index W ( G ) is the sum of distances between all unordered pairs of vertices of G . In this ... more
Source: RAIRO - Operations Research
Authors Kexiang Xu, Jie Li, Zuwen Luo
Institutions Ministry of Industry and Information Technology, Nanjing University of Aeronautics and Astronautics
Cites: 30
Cited by: 5
Related to: 10
FWCI: 1.997
Citation percentile (by year/subfield): 66.65
Subfield: Geometry and Topology
Field: Mathematics
Domain: Physical Sciences
Open Access status: hybrid