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

The expected independent domination number of random directed rooted trees

0

조회

0

다운로드

0

인용

0

참고문헌

주제분류수학

초록

Abstract

We derive a formula for the expected value µ(n) of the independent domination number of a random directed rooted tree with n labeled vertices and determine the asymptotic behavior of µ(n) as n goes to infinity.

참고문헌 (3)

  1. "The expectation of independent domination number over random binarytres", 56, pp.201~209 (2000)
  2. "The expected node-independence number of randomtres"
  3. "The Encyclopedia of Integer Sequences" (1995), AcademicPress

관련 논문AI추천

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