Indexed by:
Abstract:
Let G be a simple graph with n vertices and m edges. In this paper, we present some new upper bounds for the adjacency and the signless Laplacian spectral radius of graphs in which every pair of adjacent vertices has at least one common adjacent vertex. Our results improve some known upper bounds. The main tool we use here is the Lagrange identity.
Keyword:
Reprint 's Address:
Email:
Version:
Source :
APPLIED MATHEMATICS-A JOURNAL OF CHINESE UNIVERSITIES SERIES B
ISSN: 1005-1031
CN: 33-1171/O
Year: 2019
Issue: 1
Volume: 34
Page: 100-112
0 . 8 0 3
JCR@2019
1 . 2 0 0
JCR@2023
ESI Discipline: MATHEMATICS;
ESI HC Threshold:59
JCR Journal Grade:3
CAS Journal Grade:3
Cited Count:
WoS CC Cited Count: 1
SCOPUS Cited Count: 1
ESI Highly Cited Papers on the List: 0 Unfold All
WanFang Cited Count:
Chinese Cited Count:
30 Days PV: 1
Affiliated Colleges: