On the maximum sigma index of k-cyclic graphs

From MaRDI portal
Publication:2104923

DOI10.1016/J.DAM.2022.10.009zbMATH Open1504.05060arXiv2207.04101OpenAlexW4308219682MaRDI QIDQ2104923FDOQ2104923


Authors: Akbar Ali, Abeer M. Albalahi, A. A. Bhatti, Amjad E. Hamza, Abdulaziz M. Alanazi Edit this on Wikidata


Publication date: 8 December 2022

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Abstract: Let G be a graph with edge set E(G). Denote by dw the degree of a vertex w of G. The sigma index of G is defined as sumuvinE(G)(dudv)2. A connected graph of order n and size n+k1 is known as a connected k-cyclic graph. Abdo, Dimitrov, and Gutman [Discrete Appl. Math. 250 (2018) 57-64] characterized the graphs having the greatest sigma index over the family of all connected graphs of a fixed order. The primary goal of the present note is to determine graphs possessing the greatest sigma index from the class of all connected k-cyclic graphs of a fixed order.


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




Recommendations




Cites Work


Cited In (5)





This page was built for publication: On the maximum sigma index of \(k\)-cyclic graphs

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