Upper bound on Randić energy of some graphs
2015
Abstract Applying the Cauchy–Schwarz inequality, we obtain a sharp upper bound on the Randic energy of a bipartite graph and of graphs whose adjacency matrix is partitioned into blocks with constant row sum.
Keywords:
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
14
References
1
Citations
NaN
KQI