
Spectral radius of the Harary matrix of the join product of regular graphs1
Author(s) -
Luis Medina,
M. E. Trigo
Publication year - 2021
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/2090/1/012103
Subject(s) - combinatorics , spectral radius , mathematics , reciprocal , join (topology) , distance matrix , product (mathematics) , matrix (chemical analysis) , graph , discrete mathematics , eigenvalues and eigenvectors , physics , geometry , chemistry , linguistics , philosophy , chromatography , quantum mechanics
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 v i and V j 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.