
We characterize graphs with minimal spectral radius of the distance matrix in three classes of simple connected graphs with n vertices: with fixed vertex connectivity, matching number and chromatic number, respectively.
minimal spectral radius, matching number, Graphs and linear algebra (matrices, eigenvalues, etc.), chromatic number, Structural characterization of families of graphs, vertex connectivity, distance matric
minimal spectral radius, matching number, Graphs and linear algebra (matrices, eigenvalues, etc.), chromatic number, Structural characterization of families of graphs, vertex connectivity, distance matric
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 23 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Top 10% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Top 10% |
