Contents

Ars Combinatoria

  • Research article

The Spectral Radius of Tricyclic Graphs With \(n\) Vertices and \(k\) Pendant Edges

Miroslav Petrovic1, Bojana Borovicanin1
1Faculty of Science, University of Kragujevac, Radoja Do- manoviéa 12, 84000 Kragujevac, Serbia and Montenegro
  • Published: 31/01/2008

Abstract

In this paper we determine unique graph with largest spectral radius among all tricyclic graphs with \(n\) vertices and \(k\) pendant edges.

Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin

1970-2025 CP (Manitoba, Canada) unless otherwise stated.

Citation
Miroslav Petrovic, Bojana Borovicanin. The Spectral Radius of Tricyclic Graphs With \(n\) Vertices and \(k\) Pendant Edges[J], Ars Combinatoria, Volume 086. 77-88. .