Extremal unicyclic graphs with respect to additively weighted Harary index

From MaRDI portal
Publication:2803113

DOI10.18514/MMN.2015.808zbMATH Open1349.05184arXiv1306.4164OpenAlexW1667281079MaRDI QIDQ2803113FDOQ2803113

Jelena Sedlar

Publication date: 3 May 2016

Published in: Miskolc Mathematical Notes (Search for Journal in Brave)

Abstract: In this paper we define cycle-star graph CSk,n-k to be a graph on n vertices consisting of the cycle of length k and n-k leafs appended to the same vertex of the cycle. Also, we define cycle-path graph CPk,n-k to be a graph on n vertices consisting of the cycle of length k and of path on n-k vertices whose one end is linked to a vertex on a cycle. We establish that cycle-star graph CS3,n-3 is the only maximal graph with respect to additively weighted Harary index among all unicyclic graphs on n vertices, while cycle-path graph CP3,n-3 is the only minimal unicyclic graph (here n must be at least 5). The values of additively weighted Harary index for extremal unicyclic graphs are established, so these values are the upper and the lower bound for the value of additively weighted Harary index on the class of unicyclic graphs on n vertices.


Full work available at URL: https://arxiv.org/abs/1306.4164




Recommendations





Cited In (5)





This page was built for publication: Extremal unicyclic graphs with respect to additively weighted Harary index

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2803113)