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

THE MINIMUM EQUITABLE DOMINATING COLOR ENERGY OF A GRAPH

1

조회

0

다운로드

0

인용

0

참고문헌

키워드

주제분류수학

초록

The color energy of a graph was introduced by C. Adiga et.al.[2]. Motivated by this work, we introduce a new matrix called the minimum equitable dominating color matrix of a graph. Further we establish the minimum equitable dominating color energy of some standard graphs with their bounds.

Abstract

The color energy of a graph was introduced by C. Adiga et.al.[2]. Motivated by this work, we introduce a new matrix called the minimum equitable dominating color matrix of a graph. Further we establish the minimum equitable dominating color energy of some standard graphs with their bounds.

참고문헌 (6)

  1. C. Adiga, "The Minimum Covering Energy of a Graph", Kragujevac J. Sci., 34, pp.39~56 (2012)
  2. Chandrashekar Adiga, "Colored energy of a graph", Proceedings of the Jangjeon Mathematical Society(장전수학회 논문집), 16(3), pp.335~351 (2013), 장전수학회
  3. D. M. Cvetkovic, "Spectra of Graphs, Theory and Application" (1980), Academic Press
  4. I. Gutman, "The energy of a graph: old and new results, Combinatorics and applications", pp.196~211 (2001), Springer
  5. B. J. McClelland, "Properties of the latent roots of a matrix: The estimation of -electron energies", J. Chem. Phys., 54, pp.640~643 (1971)
  6. V. Swaminathan, "Degree Equitable Domination on Graphs", Kragujevac Journal of Mathematics, 35(1), pp.35~31 (2011)

관련 논문AI추천

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