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

Note on upper bound signed 2-independence in digraphs

2

조회

0

다운로드

0

인용

0

참고문헌

키워드

주제분류수학

초록

Let D be a finite digraph with the vertex set V(D) and arc set A(D). A two-valued function f : V(D) → {−1,1} defined on the vertices of a digraph D is called a signed 2-independence function if f(N−[v]) ≤ 1 for every v in D. The weight of a signed 2-independence function is f (V (D)) = [수식] f (v). The maximum weight of a signed 2-independence function of D is the signed 2-independence number α_s^2(D) of D. Recently, Volkmann [3] began to investigate this parameter in di- graphs and presented some upper bounds on α^2_s(D) for general digraph D. In this paper, we improve upper bounds on α_s^2(D) given by Volkmann [3].

Abstract

Let D be a finite digraph with the vertex set V(D) and arc set A(D). A two-valued function f : V(D) → {−1,1} defined on the vertices of a digraph D is called a signed 2-independence function if f(N−[v]) ≤ 1 for every v in D. The weight of a signed 2-independence function is f (V (D)) = [수식] f (v). The maximum weight of a signed 2-independence function of D is the signed 2-independence number α_s^2(D) of D. Recently, Volkmann [3] began to investigate this parameter in di- graphs and presented some upper bounds on α^2_s(D) for general digraph D. In this paper, we improve upper bounds on α_s^2(D) given by Volkmann [3].

참고문헌 (4)

  1. G. Chartrand, "Graphs and digraphs, 4th ed" (2005), Chapman and Hall
  2. M. A. Henning, "Signed 2-independence in graphs", Discrete Math, 250, pp.93~107 (2002)
  3. L. Volkmann, "Signed 2-independence in digraphs", Discrete. Math, 312, pp.465~471 (2012)
  4. B. Zelinka, "On signed 2-independence numbers of graphs", Manuscript, ~

관련 논문AI추천

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