On the Spectral Radius and the Genus of Graphs
Copyright policy )On the Spectral Radius and the Genus of Graphs
Let \(G\) be a graph of genus \(g\) and let \(r(G)\) be the largest eigenvalue of the adjacency matrix of \(G\). The author proves that \(r(G)\leq(6| V(G)|+12g-6)^{1/2}\). The bound is slightly improved in the case of some small genus surfaces.
- Shanghai Normal University China (People's Republic of)
- East China Normal University China (People's Republic of)
spectral radius, adjacency matrix, Computational Theory and Mathematics, Graphs and linear algebra (matrices, eigenvalues, etc.), eigenvalue, genus surfaces, Discrete Mathematics and Combinatorics, Planar graphs; geometric and topological aspects of graph theory, Theoretical Computer Science
spectral radius, adjacency matrix, Computational Theory and Mathematics, Graphs and linear algebra (matrices, eigenvalues, etc.), eigenvalue, genus surfaces, Discrete Mathematics and Combinatorics, Planar graphs; geometric and topological aspects of graph theory, Theoretical Computer Science
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).22 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.Average
Citations provided by BIP!Popularity provided by BIP!