Department of Computer and Communication Engineering, Ming Chuan University, The First American
University in Asia, Taoyuan, Taiwan, Chinese Taipei
Department of Computer and Communication Engineering, Ming Chuan University, The First American
University in Asia, Taoyuan, Taiwan, Chinese Taipei
Department of Electronic Information Engineering, Fuzhou University, Fuzhou, China
Department of Electronic Information Engineering, Fuzhou University, Fuzhou, China
Department of Electronic Information Engineering, Fuzhou University, Fuzhou, China
Department of Electronic Information Engineering, Fuzhou University, Fuzhou, China
Copyright © 2015 Chuan-Min Lee, Cheng-Chien Lo, Rui-Xin Ye, Xun Xu, Xiao-Han Shi, Jia-Ying Li et al. This is
an open access article distributed under the Creative Commons Attribution
License, which permits unrestricted use, distribution, and reproduction in any
medium, provided the original work is properly cited.
How to Cite this Article
Lee, C. , Lo, C. , Ye, R. , Xu, X. , Shi, X. and Li, J. (2015) Remarks on the Complexity of Signed k-Domination on Graphs.
Journal of Applied Mathematics and Physics,
3, 32-37. doi:
10.4236/jamp.2015.31005.