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

Upper bounds for energy of a graph

2

조회

0

다운로드

0

인용

0

참고문헌

키워드

주제분류수학

초록

The energy of a graph G is defined as the sum of absolute values of theeigenvalues of the graph G and is denoted by E(G). In this paper we obtaintwo eigenvalues of a strongly quotient graph SQG with n vertices and maximum number of edges and use them to establish an upper bound for energyof SQG.

Abstract

The energy of a graph G is defined as the sum of absolute values of theeigenvalues of the graph G and is denoted by E(G). In this paper we obtaintwo eigenvalues of a strongly quotient graph SQG with n vertices and maximum number of edges and use them to establish an upper bound for energyof SQG.

참고문헌 (5)

  1. C. Adiga, "On colorings of strongly multiplicative and strongly quotient graphs", Advanced Studies in Contemporary Mathematics, 13(2), pp.171~182 (2006), 장전수학회(章田數學會)
  2. C. Adiga, "Strongly quotient graphs", South East Asian J. Math. & Math. Sc, 15(2), pp.119~127 (2007)
  3. D.M. Cvetkovic, "Recent results in the theory of Graph Spectra" (1988), North Holland
  4. D.M. Cvetkovic, "Spectra of Graphs" (1980), Academic Press
  5. I. Gutman, "The energy of a Graph", Ber. Math. Stat. Sckt. Forschungzentrum Graz, 103, pp.1~22 (1978)

관련 논문AI추천

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