Open AccessDetour index of a class of unicyclic graphs
Author(s) -
Xuli Qi,
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/fil1001029x
Subject(s) - mathematics , combinatorics , vertex (graph theory) , graph , class (philosophy) , discrete mathematics , artificial intelligence , computer science
The detour index of a connected graph is defined as the sum of detour distances between all unordered pairs of vertices. We determine the n-vertex unicyclic graphs whose vertices on its unique cycle all have degree at least three with the first, the second and the third smallest and largest detour indices respectively for n ≥ 7. 2010 Mathematics Subject Classifications. 05C12, 05C35, 05C90. .
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