CORE
🇺🇦Â
 make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
research
The quotients between the (revised) Szeged index and Wiener index of graphs
Authors
Jing Chen
Shuchao Li
Huihui Zhang
Publication date
5 May 2017
Publisher
Doi
View
on
arXiv
Abstract
Let
S
z
(
G
)
,
S
z
∗
(
G
)
Sz(G),Sz^*(G)
S
z
(
G
)
,
S
z
∗
(
G
)
and
W
(
G
)
W(G)
W
(
G
)
be the Szeged index, revised Szeged index and Wiener index of a graph
G
.
G.
G
.
In this paper, the graphs with the fourth, fifth, sixth and seventh largest Wiener indices among all unicyclic graphs of order
n
⩾
10
n\geqslant 10
n
⩾
10
are characterized; as well the graphs with the first, second, third, and fourth largest Wiener indices among all bicyclic graphs are identified. Based on these results, further relation on the quotients between the (revised) Szeged index and the Wiener index are studied. Sharp lower bound on
S
z
(
G
)
/
W
(
G
)
Sz(G)/W(G)
S
z
(
G
)
/
W
(
G
)
is determined for all connected graphs each of which contains at least one non-complete block. As well the connected graph with the second smallest value on
S
z
∗
(
G
)
/
W
(
G
)
Sz^*(G)/W(G)
S
z
∗
(
G
)
/
W
(
G
)
is identified for
G
G
G
containing at least one cycle.Comment: 25 pages, 5 figure
Similar works
Full text
Available Versions
Episciences.org
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:episciences.org:dmtcs:3314
Last time updated on 02/12/2023