A tricyclic graph is a connected graph with n vertices and n + 2 edges. In this article, we determine graphs with the largest spectral radius among the n-vertex tricyclic graphs with given diameter d.
One platform for all researcher needs
AI-powered academic writing assistant
Your #1 AI companion for literature search
AI tool for graphics, illustrations, and artwork
Unlock unlimited use of all AI tools with the Editage Plus membership.
Explore Editage PlusPublished in last 50 years