Your browser does not support JavaScript!
歡迎光臨

Recent

數據載入中...
郭大衛

郭大衛  教授

研究室:理A418

電話:03-8633525  傳真: 03-8633510

E-mail:davidk@mail.ndhu.edu.tw

個人網頁:

學歷:
  國立交通大學數學博士

經歷:
  

研究領域:
  組合數學、圖形理論、演算法

論文:      

  1. Fei-Huang Chang, Young-Ming Chen, Ma-Lian Chia, David Kuo, Ming-fen Yu (2014, Aug). All-to-all broadcast problem of some classes of graphs under the half duplex all-port model. Discrete Applied Mathematics, 173, 28-34. (SCI).
     
  2. Chan-Wei Chang, David Kuo, Sheng-Chyang Liaw, Jing-Ho Yan (2014, Aug). F3-domination problem of graphs. Journal of Combinatorial Optimization, 28,400-413. (SCI)
     
  3. Gerard Jennhwa Chang, Ma-Lian Chia*, David Kuo, Ji-Yin Lin, Jing-Ho Yan (2014, May). Bandwidth sums of block graphs and cacti. Journal of Combinatorial Optimization, 27, 679-687. (SCI).
     
  4. Gerard Jennhwa Chang*, Chan-Wei Chang, David Kuo, Sheung-Hung Poon, Algorithmic aspect of stratified domination in graphs. Information Processing Letters, 113, 861-865, 2013. (SCI).
     
  5. Ma-Lian Chia, David Kuo*, Jing-Ho Yan, Siou-Ru Yang, (p,q)-total labeling of complete graphs, Journal of Combinatorial Optimization, 25, 543-561, 2013. (SCI).
     
  6. Ma-Lian Chia, Huei-Ni Hsua, David Kuo*, Sheng-Chyang Liaw, Zi-teng Xua, The game L(d,1)-labeling problem of graphs. Discrete Mathematics, 312, 3037–3045, 2012. (SCI)
     
  7. Chan-Wei Chang, Ma-Lian Chia, Cheng-Ju Hsu, David Kuo*, Li-Ling Lai, Fu-Hsing Wang, Global defensive alliances of trees and Cartesian product of paths and cycles, Discrete Applied Mathematics, 160, 479-487, 2012. (SCI)
     
  8. Ma-Lian Chia*, David Kuo, Hong-ya Liao, Cian-Hui Yang, Roger K. Yeh, L(3,2,1)-labeling of graphs, Taiwanese Journal of Mathematics, 15, 2439-2457, 2011. (SCI)
     
  9. Chan-Wei Chang, David Kuo*, Hsing-Ching Lin, Ranking numbers of graphs, Information Processing Letters, 110, 711–716, 2010. (SCI)
     
  10. Y. T. Chen, M. L. Chia and D. Kuo, "L(p,q)-labeling of digraphs," Disc. Appl. Math., 157 (2009), 1750-1759. (SCI)
     
  11. H. W. Chang, H. W. Chou, D. Kuo and C. L. Lin, “Labeling graphs with two distance constraints”, Disc. Math., 308 (2008) 5645-5655. (SCI)
     
  12. D. Kuo and J. H. Yan, “The profile of the Cartesian product of graphs”, Disc. Appl. Math., 156 (2008), 2835-2845. (SCI)
     
  13. M. L. Chia, D. Kuo and M. F. Tung, " The multiple originator broadcasting problem in graphs," Disc. Appl. Math., 155 (2007), 1188-1199.
     
  14. G. J. Chang, J.-J. Chen, D. Kuo and S.-C. Liaw, "L(d,1)-labelings of digraphs," Disc. Appl. Math., 155 (2007), 1007-1013.
     
  15. M.J. Chen, D. Kuo, J.H. Yan, “The bandwidth sum of join and composition of graphs”,Disc. Math., 290 (FEB 28 2005) 145-163.(SCI)
     
  16. D. Kuo and J. H. Yan, “On L(2,1)-labeling of the Cartesian product of paths and cycles”, Disc. Math., 283 (JUN 6 2004) 137-144. (SCI)
     
  17. S.C.Liaw, D.Kuo and G.J.Chang, “Integral sum numbers of graphs”, Ars Combinatoria, 54 (2000) 259-268. (SCIE)
     
  18. G.J.Chang, W.T.Ke, D.Kuo, D.D.-F.Liu and R.K.Yeh, “On L(d,1)-labelings of graphs”, Disc. Math., 220 (2000) 57-66. (SCI)
     
  19. D. Kuo, G. J. Chang, and Y.H.H. Kwong (1997), “ Cordial labeling of mKn,“Disc. Math. 169, 121-131. (NSC 83-0208-M009-050)
     
  20. G. J. Chang and D. Kuo (1996), “ The L (2,1) -labeling problem on graphs, “ SIAM J. Disc. Math. 9, 309-316.(NSC 82-0208-M009-050)
     
  21. D. Kuo and G. J. Chang (1994), “ The profile minimization problem, “ SIAM J. Comput. 23, 71-81. (NSC 79-0208-M009-31)
     
  22. J. H. Yan, K. W. Lih, D. Kuo, and G. J. Chang, “Signed degree sequence of signed graphs”,J Graph Theory, 26 (1997) 111-117. (SCI)


研討會論文:

1. D. Kuo. “The list-L(2,1)-labeling problem of graphs”,2005 TMS & AMS Joint International Conference. Taichung Taiwan.

研究室編號 : 理A418
備註 : 大一:數科組
職稱 : 教授
電話 : 03-8633525
E-MAIL : davidk@gms.ndhu.edu.tw
導師時間 : TUE 14:10-15:00 & WED 15:10-16:00
導師姓名 : 郭大衛(David Kuo)
教師姓名 : 郭大衛(David Kuo)
研究領域 : 組合數學、圖形理論、演算法
OfficeHour : WED 12:10-14:00
瀏覽數