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

Equivalence domination number of a tree

S. Arumugam|M. Sundarakannan
장전수학회 (Jangjeon Mathematical Society)|2012.07|Proceedings of the Jangjeon Mathematical Society(장전수학회 논문집) (Proceedings of the Jangjeon Mathematical Society)|제15권 제3호|pp. 317-323|DOI 10.17777/pjms.2012.15.3.008

2

조회

0

다운로드

0

인용

0

참고문헌

키워드

Dominationequivalence setsequivalence dominationtree ordering
주제분류수학

초록

Let G = (V,E) be a graph. A dominating set S of V is called an equivalence dominating set if every component of the induced subgraph hSi is complete. In this paper we present a dynamic programming algorithm for determining the equivalence domination number of a tree.

Abstract

Let G = (V,E) be a graph. A dominating set S of V is called an equivalence dominating set if every component of the induced subgraph hSi is complete. In this paper we present a dynamic programming algorithm for determining the equivalence domination number of a tree.

참고문헌 (14)

  1. Albertson, M.O, "The subchromatic number of a graph", Discrete Math, 74, pp.33~39 (1989)
  2. Alon, N, "Covering graphs by the minimum number of equivalence relations", Combinatorica, 6(3), pp.201~206 (1986)
  3. Arumugam, S, "Equivalence Dominating Sets in Graphs. Utilitas. Math. (to appear)", ~
  4. Blokhuis, A, "On the equivalence covering number of splitgraphs", Information Processing Letters, 54, pp.301~304 (1995)
  5. Borie, R., "Algorithms on recursively constructed graphs, In Algorithms on recursively constructed graphs. In Handbook of Graph Theory" (2004)
  6. Chartrand, G, "Graphs and Digraphs 4th edition" (2005), Chapman and Hall
  7. Cockayne, E.J, "Properties of hereditary hypergraphs and middle graphs", Canad. Math. Bull, 21, pp.461~468 (1978)
  8. Duchet, P, "Repr´esentations, noyaux en th´eorie des graphes et hypergraphes", 박사, pp.1979
  9. Dutton, R.D, "Domination in Claw-Free Graphs", Congr. Numer, 132, pp.69~65 (1998)
  10. Gimbel, J, "Subcolorings and the subchromatic number of a graph", Discrete Math, 272, pp.139~154 (2003)
  11. Haynes, T.W, "Fundamentals of Domination in Graphs" (1998), Marcel Dekker Inc
  12. Haynes, T.W, "Domination in Graphs-Advanced Topics" (1998), Marcel Dekker Inc
  13. Mynhardt, C, "Generalized colorings of graphs, In: Graph Theory with Applications to Algorithms and Computer Science", pp.583~594 (1985), Wiley
  14. Wimer, T.V, "A methodology for constructing linear graph algorithms", Cong. Numer, 50, pp.43~60 (1985)

관련 논문AI추천

TREES WITH EQUAL PERFECT AND RESTRAINED DOMINATION NUMBERSSHARADA B.장전수학회 · Advanced Studies in Contemporary Mathematics2013 · 제23권 제1호On {$[1, 2]$}-domination in trees손무영, Xue-gang Chen대한수학회 · 대한수학회논문집2018 · 제33권 제2호Double vertex-edge domination in trees손무영, Xue-gang Chen대한수학회 · 대한수학회보2022 · 제59권 제1호The outer-connected vertex edge domination number of a treeBalakrishna Krishnakumari, Yanamandram Balasubramanian Venkatakrishnan대한수학회 · 대한수학회논문집2018 · 제33권 제1호ON GRAPHS WITH EQUAL CHROMATIC TRANSVERSAL DOMINATION AND CONNECTED DOMINATION NUMBERSChidambaram Natarajan, Singaraj Kulandaiswamy Ayyaswamy, Yanamandram Balasubramanian Venkatakrishnan대한수학회 · 대한수학회논문집2012 · 제27권 제4호Domination in graphs of minimum degree fourMoo Young Sohn, Yuan Xudong대한수학회 · 대한수학회지2009 · 제46권 제4호

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

Bounded structure and continuity for homomorphisms of perfect connected locally compact groupsA. I. Shternpp. 235-240Further evaluations of Ramanujan-Weber class invariants g_nR. G. veeresha, B. R. Rakshith, G. N. Rajappapp. 241-258The Lotka- Volterra competition modelsI.D. Rezayi, M. N. Modoodi, F. Haghighifar, M. H. R. Doustpp. 259-265An investigation on the connection between learned mathematical conceptsT. Kim, S. H. Lee, J. J. Seopp. 267-282On the structure of the zeroes of the twisted (h,q)-Genocchi polynomials유천성pp. 283-291
원문 보기