지원사업
학술연구/단체지원/교육 등 연구자 활동을 지속하도록 DBpia가 지원하고 있어요.
커뮤니티
연구자들이 자신의 연구와 전문성을 널리 알리고, 새로운 협력의 기회를 만들 수 있는 네트워킹 공간이에요.
이용수
초록· 키워드
오류제보하기
The base of a signed digraph S is the minimum number k such thatfor any vertices u, v of S, there is a pair of walks of length k from u to v with different signs. Let K be a signed complete graph of order n, which is a signed digraph obtained by assigning +1 or -1 to each arc of the n-th order complete graph Kn considered as a digraph. In this paper we show that for n geq 3 the base of a primitive non-powerful signed complete graph K of order n is 2, 3 or 4.
목차
등록된 정보가 없습니다.
참고문헌 (5)
참고문헌 신청
B. Li / 2002 / Irreducible powerful ray pattern matrices / Linear Algebra and Its Appl. 342 : 47 ~ 58
L. You / 2007 / Bounds on the bases of irreducible generalized sign pattern matrices / Linear Algebra and Its Appl 427 : 285 ~ 300
Q. Li / 2008 / Bounds on the kth multi-g base index of nearly reducible sign pattern matrices / Discrete Math 308 : 4846 ~ 4860
Y. Gao / 2009 / Bases of primitive non-powerful signed symmetric digraphs with loops / Ars. Combinatoria 90 : 383 ~ 388
Y. Shao / 2009 / The local bases of non-powerful signed symmetric digraphs with loops / Ars. Combinatoria 90 : 357 ~ 369
L. You / 2007 / Bounds on the bases of irreducible generalized sign pattern matrices / Linear Algebra and Its Appl 427 : 285 ~ 300
Q. Li / 2008 / Bounds on the kth multi-g base index of nearly reducible sign pattern matrices / Discrete Math 308 : 4846 ~ 4860
Y. Gao / 2009 / Bases of primitive non-powerful signed symmetric digraphs with loops / Ars. Combinatoria 90 : 383 ~ 388
Y. Shao / 2009 / The local bases of non-powerful signed symmetric digraphs with loops / Ars. Combinatoria 90 : 357 ~ 369
이 논문의 저자 정보
최근 본 자료
댓글(0)
0