Spectral radius of the Harary matrix of the join product of regular graphs1
Open Access
- 1 November 2021
- conference paper
- Published by IOP Publishing in Journal of Physics: Conference Series
- Vol. 2090 (1) , 012103
Abstract
The distance between two vertices is equal to the number of edges on the shortest path connecting them. The Harary matrix of a simple, undirected, connected and unweighted graph of n vertices is an nonnegative matrix of order n, such that the (i, j)-entry is equal to the reciprocal distance between the vertices vi and Vj if the vertices are different and zero if are equal. In this work we found bounds for the spectral radius of the Harary matrix of the join product of regular graphs.Keywords
This publication has 7 references indexed in Scilit:
- Upper bounds and lower bounds for the spectral radius of Reciprocal Distance, Reciprocal Distance Laplacian and Reciprocal Distance signless Laplacian matricesLinear Algebra and its Applications, 2021
- Distance matrices on the H-join of graphs: A general result and applicationsLinear Algebra and its Applications, 2018
- On graphs with maximum Harary spectral radiusApplied Mathematics and Computation, 2015
- Spectra of graphs obtained by a generalization of the join graph operationDiscrete Mathematics, 2013
- Maximum eigenvalue of the reciprocal distance matrixJournal of Mathematical Chemistry, 2009
- Maximum eigenvalues of the reciprocal distance matrix and the reverse Wiener matrixInternational Journal of Quantum Chemistry, 2007
- On the Harary index for the characterization of chemical graphsJournal of Mathematical Chemistry, 1993