The analysis finds bounds for the largest eigenvalue in graphs, indicating key connectivity features.
Discrete Mathematics, Algorithms and ApplicationsAccepted Papers No AccessBounds for the Largest Eigenvalue of the Generalized Atom-Bond Connectivity Matrix of a GraphKianoosh Hayati and Farzad ShaveisiKianoosh Hayati and Farzad Shaveisihttps://orcid.org/0000-0001-9138-6321 Search for more papers by this author https://doi.org/10.1142/S1793830925501174Cited by:0 (Source: Crossref) PreviousNext AboutSectionsPDF/EPUB ToolsAdd to favoritesDownload CitationsTrack CitationsRecommend to Library ShareShare onFacebookTwitterLinked InRedditEmail FiguresReferencesRelatedDetails Recommended Accepted Papers Metrics History Received 2 January 2025 Accepted 3 August 2025 PDF download
No takes yet. Share an insight, caveat, or question.
Hayati et al. (2025) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: