No Detail Found!

Computing the sum of k largest Laplacian eigenvalues of tricyclic graphs

Author(s)
Pawan Kumar Department of Applied Mathematics, Aligarh Muslim University,Aligarh,India
S. Merajuddin Department of Applied Mathematics, Aligarh Muslim University,Aligarh,India
Shariefuddin Pirzada Department of Mathematics, University of Kashmir,Srinagar, Kashmir,India
Abstract
Let G(V; E) be a simple graph with j V (G) j = n and j E(G) j = m. If Sk(G) is the sum of k largest Laplacian eigenvalues somfGal,lethstencyBclreoiunwGer.'sIfcgonisjetchteurgeirsthtaotfesGt,htahtenSkw(eGs)howmth+atkt(hk2+e1m)efonrti1onedkconjne.ctTuhree igsitrrtuheoffoar 1grapkh Gbigs2t2hce. Wleannggthetofala. [Math. Comput. Model. 56 (2012) 60-68] proved that Brouwer's conjecture is true for bicyclic and tricyclic graphs whenever 1 k n with k 6= 3. We settle the conjecture under discussion also for tricyclic graphs having no pendant vertices when k = 3.
Publication Details
Page(s) 14-18
Published Journal: Discrete Mathematics Letters, Volume: 11, Issue: 0, Year: 2023

Request the full text from PASTIC

Keywords
Degree sequence, tricyclic graph, Laplacian matrix, Brouwer's conjecture, Laplacian eigenvalues
0

Citations

0

Downloads

57

Views