Discrete Mathematics , Algorithms and Applications ( DMAA )

2. Discrete Mathematics, Algorithms and Applications (DMAA) • http://www.worldscinet.com/dmaa/dmaa.shtml

4. About DMAA: Aims & Scope • The aim of this journal is to advance and promote the theory and applications of discrete mathematics, which is a research area in mathematics with applications in computer science, industrial engineering, bio-informatics, chemistry and communication networks. • The journal encourages contributions from the two important parts of discrete mathematics, graph theory and combinatorics. The former includes structural graph theory, extremal graph theory, algebraic graph theory, random graphs and internet graphs. The latter consists of combinatorial design, combinatorial enumeration, coding theory, combinatorial probabilistic method, etc.

6. Associate Editors Jean-Claude Bermond (CNRS-UNSA, France) Annalisa De Bonis (Università degli Studi di Salerno, Italy) Kyung-Yong Chwa (Korea Advanced Institute of Science and Technology, Korea) C.J. Colbourn (Arizona State University, Tempe, USA) Bhaskar Dasgupt (University of Illinois at Chicago, USA) M. Deza (Ecole Normale Supérieure, Paris, France) Hung-Lin Fu (National Chiaotong University, Taiwan) Suogang Gao (Hebei Normal University, Shijiazhuang, China) Dan Hirschberg (University of California, Irvine, USA) Xiaodong Hu (Chinese Academy of Sciences, Beijing, China)

7. Evangelos Kranakis (Carleton University, Canada) Deying Li (Renmin University, Beijing, China) Hao Li (CNRS, Université Paris-Sud, Paris, France) Xueliang Li (Nankai University, Tianjin, China) Anthony J. Macula (State University of New York at Geneseo, USA) Hung Q. Ngo (State University of New York at Buffalo, USA) Vyacheslav Rykov (University of Nebraska at Omaha, USA) Jiayu Shao (Tongji University, Shanghai, China) Alexander Schliep (Max Planck Institute for Molecular Genetics, Germany) Alexey A. Tuzhilin (Moscow State University, Russia)

8. Catherine Yan (Texas A&M University, USA) Guiying Yan (Chinese Academy of Sciences, Beijing, China) Boting Yang (University of Regina, Canada) Yeong-Nan Yeh (Institute of Mathematics, Academia Sinica, Taipei, Taiwan) Jianxing Yin (Suzhou University, Suzhou, China) Xingxing Yu (Georgia Institute of Technology, Atlanta, USA) Wenan Zang (University of Hong Kong, Hong Kong) Alex Zelikovsky (Georgia State University, USA) Cunquan Zhang (West Virginia University, West Virginia, USA) Zhao Zhang (Xinjiang University, Wulumuqi, China)

9. Table of Contents (DMAA) olume: 1,Issue:1 (March 2009) 1ON THE PIPAGE ROUNDING ALGORITHM FOR SUBMODULAR FUNCTION MAXIMIZATION — A VIEW FROM DISCRETE CONVEX ANALYSIS AKIYOSHI SHIOURA Page 1 – 23 2 ON THE LONGEST RNG EDGE OF WIRELESS AD HOC NETWORKS PENG-JUN WAN; LIXIN WANG; FRANCES YAO; CHIH-WEI YI Page 25 – 43 3 MINIMUM CONNECTED r-HOP k-DOMINATING SET IN WIRELESS NETWORKS DEYING LI; LIN LIU; HUIQIANG YANG Page 45 – 57 4PCR NONADAPTIVE GROUP TESTING OF DNA LIBRARIES FOR BIOMOLECULAR COMPUTING AND TAGGANT APPLICATIONS ANTHONY J. MACULA; SUSANNAH GAL; CHERYL ANDAM; MORGAN A. BISHOP; THOMAS E. RENZ Page 59 – 69 5 ANALYSIS ON THEORETICAL BOUNDS FOR APPROXIMATING DOMINATING SET PROBLEMS XIAOFENG GAO; YUEXUAN WANG; XIANYUE LI; WEILI WU Page 71 – 84 6 ON PLANARITY OF DIRECT PRODUCT OF MULTIPARTITE COMPLETE GRAPHS LAURENT BEAUDOU; PAUL DORBEC; SYLVAIN GRAVIER; PRANAVA K. JHA Page 85 – 104 7A CONSTRUCTION OF CARTESIAN AUTHENTICATION CODE FROM ORTHOGONAL SPACES OVER A FINITE FIELD OF ODD CHARACTERISTIC ZENGTI LI; SUOGANG GAO; ZHONG WANG; BHAVANI THURAISINGHAM; WEILI WU Page 105 – 114 8WHEN DO THREE LONGEST PATHS HAVE A COMMON VERTEX? MARIA AXENOVICH Page 115 – 120 9THE CLIQUE MINOR OF GRAPHS WITH INDEPENDENCE NUMBER TWO SHIYOU PANG; LIANYING MIAO; QINGBO SUN; ZHENGKE MIAO Page 121 – 125 10ANALYZING NONBLOCKING MULTILOG NETWORKS WITH THE KÖNIG–EGEVARÝ THEOREM HUNG Q. NGO; THANH-NHAN NGUYEN; DUC T. HA Page 127 - 139