본문 바로가기
KERD
논문KCI 등재

Minimum Covering Randic Energy of a Graph

0

조회

0

다운로드

3

인용

0

참고문헌

키워드

주제분류수학

초록

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, \cite{a}.

Abstract

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, \cite{a}.

참고문헌 (6)

  1. C. Adiga, "The minimum covering energy of a graph", Kragujevac J. Sci., 34, pp.39~56 (2012)
  2. S. Alikhani, "More on Energy and Randic Energy of Specific Graphs", Journal of Mathematical Extension, 9(3), pp.73~85 (2015)
  3. S. B. Bozkurt, "Randic matrix and Randic energy", MATCH Commun. Math. Comput. Chem., 64, pp.239~250 (2010)
  4. I. Gutman, "The energy of a graph", Ber. Math. Stat. Sekt. Forschungsz. Graz, 103, pp.1~22 (1978)
  5. I. Gutman, "Algebraic Combinatorics and Applications", pp.196~211 (2001), Springer-Verlag
  6. I. Gutman, "On Randic energy", Linear Algebra Appl., 442, pp.50~57 (2014)

관련 논문AI추천

이 간행물의 다른 논문 (14건)