“Whoa! It's like Spotify but for academic articles.”

Instant Access to Thousands of Journals for just $40/month

Get 2 Weeks Free

On the revised Szeged index

We give bounds for the revised Szeged index, and determine the n -vertex unicyclic graphs with the smallest, the second-smallest and the third-smallest revised Szeged indices for n ≥ 5 , and the n -vertex unicyclic graphs with the k th-largest revised Szeged indices for all k up to 3 for n = 5 , to 5 for n = 6 , to 6 for n = 7 , to 7 for n = 8 , and to ⌊ n 2 ⌋ + 4 for n ≥ 9 . We also determine the n -vertex unicyclic graphs of cycle length r , 3 ≤ r ≤ n , with the smallest and the largest revised Szeged indices. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Discrete Applied Mathematics Elsevier
Loading next page...

You're reading a free preview. Subscribe to read the entire article.

And millions more from thousands of peer-reviewed journals, for just $40/month

Get 2 Weeks Free

To be the best researcher, you need access to the best research

  • With DeepDyve, you can stop worrying about how much articles cost, or if it's too much hassle to order — it's all at your fingertips. Your research is important and deserves the top content.
  • Read from thousands of the leading scholarly journals from Springer, Elsevier, Nature, IEEE, Wiley-Blackwell and more.
  • All the latest content is available, no embargo periods.

Stop missing out on the latest updates in your field

  • We’ll send you automatic email updates on the keywords and journals you tell us are most important to you.
  • There is a lot of content out there, so we help you sift through it and stay organized.