Kyungpook Mathematical Journal

  • 제57권4호
  • /
  • Pages.701-709
  • /
  • 2017
  • /
  • 1225-6951(pISSN)
  • /
  • 0454-8124(eISSN)
경북대학교 자연과학대학 수학과 (Department of Mathematics, Kyungpook National University)
권호 표지
DOI QR코드

DOI QR Code

Minimum Covering Randic Energy of a Graph

  • 투고 : 2016.12.05
  • 심사 : 2017.11.17
  • 발행 : 2017.12.23
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

In this paper, we introduce the minimum covering Randic energy of a graph. We compute minimum covering Randic energy of some standard graphs and establish upper and lower bounds for this energy. Also we disprove a conjecture on Randic energy which is proposed by S. Alikhani and N. Ghanbari, [2].

키워드

참고문헌

  1. C. Adiga, A. Bayad, I. Gutman and A. S. Shrikanth, The minimum covering energy of a graph, Kragujevac J. Sci., 34(2012), 39-56.
  2. S. Alikhani and N. Ghanbari, More on Energy and Randic Energy of Specific Graphs, Journal of Mathematical Extension, 9(3)(2015), 73-85.
  3. S. B. Bozkurt, A. D. Gungor, I. Gutman and A. S. Cevik, Randic matrix and Randic energy, MATCH Commun. Math. Comput. Chem., 64(2010), 239-250.
  4. I. Gutman, The energy of a graph, Ber. Math. Stat. Sekt. Forschungsz. Graz, 103(1978), 1-22.
  5. I. Gutman, The energy of a graph: old and new results, in: A. Betten, A. Kohnert, R. Laue and A. Wassermann (Eds.), Algebraic Combinatorics and Applications, Springer-Verlag, Berlin, 2001, 196-211.
  6. I. Gutman, B. Furtula and S. B. Bozkurt, On Randic energy, Linear Algebra Appl., 442(2014), 50-57. https://doi.org/10.1016/j.laa.2013.06.010