Korean Journal of Mathematics

The Kangwon-Kyungki Mathematical Society (강원경기수학회)
권호 표지
DOI QR코드

DOI QR Code

THE BASES OF PRIMITIVE NON-POWERFUL COMPLETE SIGNED GRAPHS

  • Received : 2014.07.31
  • Accepted : 2014.09.19
  • Published : 2014.09.30
Download PDF
⟨ Previous Next ⟩

Abstract

The base of a signed digraph S is the minimum number k such that for 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 $K_n$ 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.

Keywords

References

  1. Y. Gao, Y. Huang and Y. Shao, Bases of primitive non-powerful signed symmetric digraphs with loops, Ars. Combinatoria 90 (2009), 383-388.
  2. B. Li, F. Hall and J. Stuart, Irreducible powerful ray pattern matrices, Linear Algebra and Its Appl., 342 (2002), 47-58. https://doi.org/10.1016/S0024-3795(01)00436-0
  3. Q. Li and B. Liu, Bounds on the kth multi-g base index of nearly reducible sign pattern matrices, Discrete Math. 308 (2008), 4846-4860. https://doi.org/10.1016/j.disc.2007.09.004
  4. Y. Shao and Y. Gao, The local bases of non-powerful signed symmetric digraphs with loops, Ars. Combinatoria 90 (2009), 357-369.
  5. L. You, J. Shao and H. Shan, Bounds on the bases of irreducible generalized sign pattern matrices, Linear Algebra and Its Appl. 427 (2007), 285-300. https://doi.org/10.1016/j.laa.2007.07.019

Cited by

  1. BASE OF THE NON-POWERFUL SIGNED TOURNAMENT vol.23, pp.1, 2014, https://doi.org/10.11568/kjm.2015.23.1.29