Bounds for symmetric division deg index of graphs
Work
Year: 2019
Type: article
Abstract: LetG = (V,E) be a simple connected graph of order n (?2) and size m, where V(G) = {1, 2,..., n}. Also let ? = d1 ? d2 ?... ? dn = ? > 0, di = d(i), be a sequence of its vertex degrees with maximum ... more
Source: Filomat
Institutions Sungkyunkwan University, University of Nis
Cites: 17
Cited by: 20
Related to: 10
FWCI: 2.572
Citation percentile (by year/subfield): 82.37
Subfield: Geometry and Topology
Field: Mathematics
Domain: Physical Sciences
Open Access status: gold