Open AccessDegree distance of unicyclic graphs
Author(s) -
Zhibin Du,
Bo Zhou
Publication year - 2010
Publication title -
filomat
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.449
H-Index - 34
eISSN - 2406-0933
pISSN - 0354-5180
DOI - 10.2298/fil1004095d
Subject(s) - mathematics , combinatorics , degree (music) , vertex (graph theory) , graph , discrete mathematics , physics , acoustics
The degree distance of a connected graph G with vertex set V(G) is defined as D'(G)= Σu∈V (G) dG (u)DG (u), where dG (u) denotes the degree of vertex u and DG (u) denotes the sum of distances between u and all vertices of G. We determine the maximum degree distance of n-vertex unicyclic graphs with given maximum degree, and the first seven maximum degree distances of n-vertex unicyclic graphs for n ≥ 6.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom