Bounds on the ABC spectral radius of a tree
Let G be a simple connected graph with vertex set {1,2,...,n} and di denote the degree of vertex i in G. The ABC matrix of G, recently introduced by Estrada, is the square matrix whose ijth entry is √((di+dj-2)/didi); if i and j are adjacent, and zero; otherwise. The entries in ABC matrix represent...
Tallennettuna:
Päätekijät: | Barik, Sasmita; School of Basic Sciences IIT Bhubaneswar, Bhubaneswar, 752050, India (Tekijä), Rani, Sonu; School of Basic Sciences IIT Bhubaneswar, Bhubaneswar, 752050, India (Tekijä) |
---|---|
Aineistotyyppi: | EJournal Article |
Julkaistu: |
GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB,
2020-10-30.
|
Aiheet: | |
Linkit: | Get Fulltext |
Tagit: |
Lisää tagi
Ei tageja, Lisää ensimmäinen tagi!
|
Samankaltaisia teoksia
-
Bounds for the Laplacian spectral radius of graphs
Tekijä: Patra, Kamal Lochan; School of Mathematical Sciences National Institute of Science Education and Research, Bhubaneswar (HBNI), et al.
Julkaistu: (2017) -
Some new graceful generalized classes of diameter six trees
Tekijä: Mishra, Debdas; C. V. Raman College of Engineering, Bhubaneswar, India, et al.
Julkaistu: (2017) -
On the k-rainbow domination in graphs with bounded tree-width
Tekijä: Meybodi, M. Alambardar; Department of Applied Mathematics and Computer Science, Faculty of Mathematics and Statistics, University of Isfahan, Iran, et al.
Julkaistu: (2021) -
Bounds for graph energy in terms of vertex covering and clique numbers
Tekijä: Ganie, Hilal A.; Department of Mathematics, University of Kashmir, Srinagar, Kashmir, India, et al.
Julkaistu: (2019) -
On strict-double-bound numbers of graphs and cut sets
Tekijä: Ikeda, Kazutaka; Department of Mathematical Sciences, Tokai University, Hiratsu, et al.
Julkaistu: (2021)