Base of the non-powerful signed tournament
2
조회
0
다운로드
0
인용
0
참고문헌
키워드
초록
A signed digraph $S$ is the digraph $D$ by assigning signs $1$ or $-1$ to each arc of $D$. The base of $S$ is the minimum number $k$ such that there is a pair walks which have the same initial and terminal point with length $k$, but different signs. In this paper we show that for $n\geq 5$ the upper bound of the base of a primitive non-powerful signed tournament $S_n$, which is the signed digraph by assigning $1$ or $-1$ to each arc of a primitive tournament $T_n$, is ${\rm max}\{2n+2, n+11\}$. Moreover we show that it is extremal except when $n=5,7$.
Abstract
A signed digraph $S$ is the digraph $D$ by assigning signs $1$ or $-1$ to each arc of $D$. The base of $S$ is the minimum number $k$ such that there is a pair walks which have the same initial and terminal point with length $k$, but different signs. In this paper we show that for $n\geq 5$ the upper bound of the base of a primitive non-powerful signed tournament $S_n$, which is the signed digraph by assigning $1$ or $-1$ to each arc of a primitive tournament $T_n$, is ${\rm max}\{2n+2, n+11\}$. Moreover we show that it is extremal except when $n=5,7$.
참고문헌 (8)
- V. K. Balakrishnan, "Graph theory" (1997), McGraw-Hill
- Y. Gao, "Bases of primitive non-powerful signed sym-metric digraphs with loops, Ars", Combinatoria, 90, pp.383~388 (2009)
- B. Li, "Irreducible powerful ray pattern matrices", Linear Algebra and Its Appl., 342, pp.47~58 (2002)
- Q. Li, "Bounds on the kth multi-g base index of nearly reducible sign pattern matrices", Discrete Math, 308, pp.4846~4860 (2008)
- J. Moon, "On the powers of tournament matrices", J. Comb. Theory, 3, pp.1~9 (1967)
- Y. Shao, "The local bases of non-powerful signed symmetric digraphs with loops, Ars", Combinatoria, 90, pp.357~369 (2009)
- 송병철, "The bases of primitive non-powerful complete signed graphs", 한국수학논문집, 22(3), pp.491~500 (2014), 강원경기수학회[DOI]
- L. You, "Bounds on the bases of irreducible generalized sign pattern matrices", Linear Algebra and Its Appl, 427, pp.285~300 (2007)