Xueliang Li

Professor

Center for Combinatorics
Nankai University
Tianjin 300071
China

Interests

• Graph Theory and its Applications
• Combinatorial Optimizations, Algorithms and Complexity Analysis, NP-hard Problems
• Discrete Mathematics and its Applications in Computer Science, Chemistry and Biology, etc.

Working Experiences

• Dec. 1987, Master's degree in Graph Theory, Lanzhou University, China
• Oct. 1991, PhD degree in Discrete Mathematics, University of Twente, The Netherlands
• July 2001 to present, Professor and Advisor for Ph.D Students in Nankai University (Tianjin, China), Executive Director of the Center for Combinatorics, Co-Dean of the School of Mathematical Sciences
• July 1994 to July 2001, Professor and Advisor for Ph.D Students in Northwestern Polytechnical University (Xi'an, China), Dean of the Department of Applied Mathematics
• Dec. 1992 to July 1994, Professor in Xinjiang University (Urumqi, China), Deputy Director of the Institute of Mathematics and Physics
• 12 academic and research visits to the Faculty of Mathematical Science, University of Twente, the Netherlands
• 2 research visits to the Institute of Mathematics, National Autonomous University of Mexico (UNAM) (TWAS Associate)
• 1 research visit to the Department of Mathematics, University of Hong Kong
• 4 research visits to the Department of Computer Science, City University of Hong Kong
• 1 academic visit to the United Kingdom (Rolls & Royce, Cambridge University, Oxford University)
• 2 academic visits to Japan (Ibaraki University, Keio University, Nihon University, Science University of Tokyo)
• 1 research visit to the United States of America (University of Mississippi, West Virginia University, etc.)
• 1 research visit to the International Centre for Theoretical Physics (ICTP), Trieste, Italy

Members of Editorial Boards for Journals

• Graphs and Combinatorics (SCI) (Japan)
• Acta Mathematicae Applicatae Sinica (Chinese Series) (China)
• Discussiones Mathematicae Graph Theory (Poland)
• MATCH Communications in Mathematical and in Computer Chemistry (SCI, 2007 IF 2.580) (Serbia)
• AKCE International Journal of Graphs and Combinatorics (India)
• Scientific Journals International: Journal of Mathematical Sciences (USA)
• Mathematica Applicata (China)
• Pure and Applied Mathematics (China)

Co-Chair and Committee Members

• Vice President and Secretary-General for the Chinese Society of Combinatorics and Graph Theory
• Secretary-General of Tianjin Society for Industrial and Applied Mathematics (TJSIAM)
• Technical Committee on Networks of the International Association of Science and Technology for Development (IASTED)
• Program Committee for the International Symposium on Graph Theory and Combinatorial Algorithms 2007 (GTCA2007)
• Program Committee for the International Workshop on Graph Theory, Algorithms, and its Applications in Computer Science 2007 (IWGA2007)
• Program Committee for the International MultiConference of Engineers and Computer Scientists (IMECS2006), (IMECS2007), (IMECS2008)
• Co-Chair of the IAENG International Workshop/Conference on Computer Science (IWCS'06), (ICCS'07), (ICCS'08)
• Committee Member of the IAENG International Workshop/Conference on Operations Research (IWOR'06), (ICOR'07), (ICOR'08)
• Committee Member of the IAENG International Workshop/Conference on Bioinformatics (IWB'06), (ICB'07), (ICB'08)
• Program Committee for the China-Japan Conference on Discrete Goemetry, Combinatorics and Graph Theory 2005 (CJCDGCGT 2005)

Number of Postgraduate Students

• 37 Ph.D students, 20 of them graduated.
• 21 Master's degree students, 19 of them graduated.
• 01 Postdoctor.
  
  

Scientific Genealogy

X. Li (graph theory) to C. Hoede (discrete mathematics), to van Spiegel (geometry), to Gerretsen (geometry), to Schaake (geometry), to de Vries (mathematical physics), to Korteweg (mathematics, known for the Korteweg de Vries equation for solitons), to van der Waals (theoretical physics, known for the van der Waals equation for which he got the Nobel prize), to Rijke (mathematics, about 1840 in Leiden), to Uylenbroek (history of mathematics), to Ekama (philosophy), to Chaudoir (philosophy), to van Swinden (physics), to Hennert (philosophy), to LEONHARD EULER (mathematics, founder of graph theory), to Johann Bernoulli (mathematics), to Jacob Bernoulli (mathematics), to GOTTFRIED LEIBNIZ (mathematics and philosophy, inventor of differential calculus), to Weigel (mathematics, around 1650 in Leipzig), to unknown.

Books

• Mathematical Aspects of Randic-Type Molecular Structure Descriptors, Mathematical Chemistry Monographs No.1, Kragujevac, 2006, pp.VI+330. (with I. Gutman).
  
  
• Special Issue Dedicated to Prof. Fuji Zhang on the occasion of his 70th birthday, MATCH Communications in Mathematical and in Computer Chemistry 56(3)(2006). (Guest Editor, with X.F. Guo and Z.B. Chen).
  
  
• Discrete Geometry, Combinatorics and Graph Theory, 7th China-Japan Conference, CJCDGCGT 2005, Tianjin, China, November 18-20, 2005, and Xi'an, China, November 22-24, 2005, Lecture Notes in Computer Science, Vol.4381, 2007, Springer (Volume Editor, with J. Akiyama, W.Y.C. Chen, M. Kano and Q. Yu).
  
  

Selected Papers

• Graph Energy, Analysis of Complex Networks: From Biology to Linguistics, Dehmer, Emmert-Streib (Eds.), Wiley-VCH Verlag. (with I. Gutman and J.B. Zhang).
  
  
• Isomorphisms of directed P_3-graphs, accepted for publication in Ars Combinatoria. SCI. (with Y. Liu and B. Zhao).
  
  
• The heterochromatic matchings in edge-colored bipartite graphs, accepted for publication in Ars Combinatoria. SCI. (with H. Li, G.Z. Liu and G.H. Wang).
  
  
• Complexity of conditional colorability of graphs, Applied Math. Letter. in press. SCI. (with X.M. Yao, W.L. Zhou and H.J. Broersma).
  
  
• Maximum energy trees with two maximum degree vertices, J. Math. Chem. in press. SCI. (with X.M. Yao, J.B. Zhang and I. Gutman).
  
  
• Bipartite rainbow numbers of matchings, Discrete Math. in press. SCI. (with J.H. Tu and Z.M. Jin).
  
  
• Some families of integral graphs, Discrete Math. in press. SCI. (with L.G. Wang, H.J. Broersma, C. Hoede and G. Still).
  
  
• Graphs with the second largest number of maximal independent sets, Discrete Math. in press. SCI. (with Z.M. Jin).
  
  
• Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey, Graphs and Combinatorics 24(2008). SCI. (with M. Kano).
  
  
• The general sigma all-ones problem for trees, Discrete Appl. Math. 156(2008). SCI. (with C. Wang and X.Y. Zhang).
  
  
• Heterochromatic tree partition numbers for complete bipartite graphs, Discrete Math. 308(17)(2008). SCI. (with H. Chen, Z.M. Jin and J.H. Tu).
  
  
• The 2nd order conditional 3-coloring of claw-free graphs, Theoretical Computer Science 396(1-3)(2008). SCI. (with W.L. Zhou).
  
  
• Hypoenergetic trees, MATCH Commun. Math. Comput. Chem. 60(2)(2008). SCI. (with I. Gutman, Y.T. Shi and J.B. Zhang).
  
  
• Nonexistence of triples of nonisomorphic connected graphs with isomorphic connected P_3-graphs, Electron. J. Combin. 15(1)(2008), #31. SCI. (with Y. Liu).
  
  
• Binary construction of quantum codes of minimum distances five and six, Discrete Math. 308(2008). SCI. (with R.H. Li).
  
  
• Three new versions of the all-ones problem, Acta Mathematica Scientia 28A(3) (2008). (with X.Y. Zhang).
  
  
• More on the best upper bound for the Randic index R_{-1} of trees, MATCH Communications in Mathematical and in Computer Chemistry 60(2)(2008). SCI. (with L. Pavlovic and M. Stojanovic).
  
  
• Minimum general Randic index on chemical trees with given order and number of pendent vertices, MATCH Communications in Mathematical and in Computer Chemistry 60(2)(2008). SCI. (with Y.T. Shi and L.P. Zhong).
  
  
• Vertex partitions of r-edge-colored graphs, Appl. Math. J. Chinese Univ. Ser.B 23(1)(2008). (with Z.M. Jin).
  
  
• A survey on the Randic index, MATCH Communications in Mathematical and in Computer Chemistry 59(1)(2008). SCI. (with Y.T. Shi).
  
  
• NP-completeness of 4-incidence colorability of semi-cubic graphs, Discrete Math. 308(2008). (with J.H. Tu).
  
  
• Color neighborhood union conditions for long heterochromatic paths in edge-colored graphs, Electron. J. Combin. 14(2007), #77. SCI. (with H. Chen).
  
  
• The spread of unicyclic graphs with given size of maximum matchings, J. Math. Chem. 42(4)(2007). SCI. (with J.B. Zhang and B. Zhou).
  
  
• On unicyclic conjugated molecules with minimal energies, J. Math. Chem. 42(4)(2007). SCI. (with J.B. Zhang and B. Zhou).
  
  
• Corrections of proofs for Hansen and Melot's two theorems, Discrete Appl. Math. 155(17)(2007). SCI. (with Y.T. Shi).
  
  
• Path graphs versus line graphs - a survey, Chinese J. Engineering Math. 24(5)(2007). (with Y. Liu).
  
  
• On the complexity of dominating set problems related to the minimum all-ones problem, Theoretical Computer Science 385(1-3)(2007). SCI. (with H.J. Broersma).
  
  
• On the minimum monochromatic or multicolored subgraph partition problems, Theoretical Computer Science 385(1-3)(2007). SCI. (with X.Y. Zhang).
  
  
• On bicyclic graphs with maximal energy, Linear Algebra and Its Applications 427(2007). SCI. (with J.B. Zhang).
  
  
• The neighbor-scattering number can be computed in polynomial time for interval graphs, Computers and Mathematics with Applications 54(5)(2007). SCI, EI. (with F.W. Li).
  
  
• Integral trees of diameter 6, Discrete Appl. Math. 155(10)(2007). SCI, EI. (with H.J. Broersma, C. Hoede, G. Still and L.G. Wang).
  
  
• More on "Solutions to Two Unsolved Questions on the Best Upper Bound for the Randic Index R-1 of Trees", MATCH Communications in Mathematical and in Computer Chemistry 58(1)(2007). SCI. (with L. Pavlovic and M. Stojanovic).
  
  
• Connected (n,m)-graphs with minimum and maximum zeroth-order general Randic index, Discrete Appl. Math. 8(155)(2007). SCI, EI. (with Y.M. Hu, Y.T. Shi and T.Y. Xu).
  
  
• Chromaticity of the complements of some sparse graphs, Australas. J. Combin. 37(Feb.)(2007). (with R.Y. Liu and H.X. Zhao).
  
  
• Sufficient conditions for the existence of perfect heterochromatic matchings in colored graphs, Discrete Geometry, Combinatorics and Graph Theory, 7th China-Japan Conference, CJCDGCGT 2005, Tianjin, China, November 18-20, 2005, and Xi'an, China, November 22-24, 2005, Lecture Notes in Computer Science, Vol.4381, 2007, Springer. SCI. (with L. Hu).
  
  
• The binding number of a digraph, Discrete Geometry, Combinatorics and Graph Theory, 7th China-Japan Conference, CJCDGCGT 2005, Tianjin, China, November 18-20, 2005, and Xi'an, China, November 22-24, 2005, Lecture Notes in Computer Science, Vol.4381, 2007, Springer. SCI. (with G.J. Xu and S.G. Zhang).
  
  
• A characterization of graphs without even factors, Graphs and Combinatorics 22(4)(2006). SCI. (with Z. Zhang).
  
  
• Linear quantum codes of minimum distance three, International J. Quantum Information 4(6)(2006). SCI. (with R.H. Li and Z.B. Xu).
  
  
• Unicyclic graphs with maximum general Randic index for alpha>0, MATCH Communications in Mathematical and in Computer Chemistry 56(3)(2006). (with Y.T. Shi and T.Y. Xu).
  
  
• Partitioning 2-edge-colored complete multipartite graphs into monochromatic cycles, paths and trees, J. Combin. Optimization 11(4)(2006). SCI. EI. (with Z.M. Jin, M. Kano and B. Wei).
  
  
• On the Fibonacci numbers of trees, The Fibonacci Quarterly 44(1)(2006). SCI. (with H.X. Zhao).
  
  
• On the k-path cover problem for cacti, Theoretical Computer Science 355(3)(2006). SCI, EI. (with Z.M. Jin).
  
  
• Complete solution for unicyclic graphs with minimum general Randic index, MATCH Communications in Mathematical and in Computer Chemistry 55(2)(2006). SCI. (with L.S. Wang and Y.T. Zhang).
  
  
• Extremal chemical trees with minimum or maximum general Randic index, MATCH Communications in Mathematical and in Computer Chemistry 55(2)(2006). SCI. (with J. Zheng).
  
  
• Maximum tree and maximum value for the Randic index R_{-1} of trees of order n<=102, MATCH Communications in Mathematical and in Computer Chemistry 55(1)(2006). SCI. (with Y.M. Hu, Y.L. Jin and L.S. Wang).
  
  
• Computational complexity and bounds for neighbor-scattering number of graphs, Proc. ISPAN2005, Dec. 7-9, Las Vegas, Nevada, USA. EI. (with F.W. Li).
  
  
• A combinatorial algorithm for minimum weighted colorings of claw-free perfect graphs, Journal of Combinatorial Optimization 9(4)(2005). SCI, EI. (with W.A. Zang).
  
  
• On the Merrifield-Simmons index of trees, MATCH Communications in Mathematical and in Computer Chemistry 54(2)(2005). SCI. (with I. Gutman and H.X. Zhao)
  
  
• On molecular graphs with smallest and greatest zeroth-order general Randic index, MATCH Communications in Mathematical and in Computer Chemistry 54(2)(2005). SCI. (with I. Gutman, Y.M. Hu, Y.T. Shi and T.Y. Xu).
  
  
• Solutions to two unsolved questions on the best upper bound for the Randic index R_{-1} of trees, MATCH Communications in Mathematical and in Computer Chemistry 54(2)(2005). SCI. (with Y.M. Hu and Y. Yuan).
  
  
• Long heterochromatic paths in edge-colored graphs, Electronic J. Combin. 12(2005), #R33. SCI. (with H. Chen).
  
  
• Two classes of integral regular graphs, Ars Combin. 76(2005) SCI. (with L.G. Wang and C. Hoede).
  
  
• Integral trees with diameters 5 and 6, Discrete Math. 297(2005). SCI, EI. (with L.G. Wang).
  
  
• Rupture degree of graphs, International J. Computer Math. 82(7)(2005). SCI, EI. (with Y.K. Li and S.G. Zhang).
  
  
• On problems and conjectures on adjointly equivalent graphs, Discrete Math. 295(1-3)(2005) 203-212. SCI, EI. (with H.X. Zhao and R.Y. Liu).
  
  
• Two approaches for the generalization of leaf edge exchange graphs on spanning trees to connected spanning k-edge subgraphs of a graph, Ars Combin. 75(2005) 257-265. SCI. (with V. Neumman-Lara and E. Rivera-Campo).
  
  
• A unified approach to the extremal trees for different indices, MATCH Communications in Mathematical and in Computer Chemistry 54(1)(2005). SCI. (with J. Zheng).
  
  
• Paths and cycles in colored graphs, Australasian J. Combin. 31(2005). (with H.J. Broersma, G. Woeginger and S.G. Zhang).
  
  
• Matrix method for linear sequential dynamical systems on digraphs, Applied Mathematics and Computation 160(1)(2005). SCI, EI. (with William Y.C. Chen and J. Zheng).
  
  
• Linear time algorithms to the minimum all-ones problem for unicyclic and bicyclic graphs, Electronic Notes in Discrete Math. 17(2004). (with William Y.C. Chen, C. Wang and X.Y. Zhang).
  
  
• On the integrity of graphs, Proceedings of the 16th IASTED International Conference on Parallel and Distributed Computing and Systems, 2004, p 577-582. EI. (with F.W. Li).
  
  
• Isomorphisms of P_k-graphs, Discrete Math. 289(1-3)(2004). SCI, EI. (with B. Zhao).
  
  
• The complexity for partitioning graphs by monochromatic trees, cycles and paths, International J. Computer Math. 81(11)(2004). SCI. (with Z.M. Jin).
  
  
• Removable edges in a cycle of a 4-connected graph, Discrete Math. 287(1-3)(2004). SCI, EI. (with J.C. Wu and L.S. Wang).
  
  
• Removable edges in longest cycles of 4-connected graphs, Graphs and Combin. 20(3)(2004). SCI. (with J.C. Wu).
  
  
• The chromaticity of certain complete multipartite graphs, Graphs and Combin. 20(3)(2004). SCI. (with H.X. Zhao, R.Y. Liu and C.F. Ye).
  
  
• The number of removable edges in a 4-connected graph, J. Combin. Theory, Ser.B, 92(2004) 13-40. SCI. (with J.C. Wu and J.J. Su).
  
  
• On properties of adjoint polynomials of graphs and its applications, Australasian J. Combin. 30(2004). (with H.X. Zhao, R.Y. Liu and L.G. Wang).
  
  
• The hamiltonian index of a graph and its branch-bonds, Discrete Math. 285(1-3)(2004). SCI, EI. (with L.M. Xiong, H.J. Broersma and M.C. Li).
  
  
• On the lower and upper bounds for general Randic index of chemical (n,m)-graphs, MATCH Communications in Mathematical and in Computer Chemistry 52(2004). SCI. (with X.Q. Wang and B. Wei).
  
  
• Best lower and upper bounds for the Randic index R_{-1} of chemical trees, MATCH Communications in Mathematical and in Computer Chemistry 52(2004). SCI. (with Y.T. Yang).
  
  
• Trees with maximum general Randic index, MATCH Communications in Mathematical and in Computer Chemistry 52(2004). SCI. (with Y.M. Hu and Y. Yuan).
  
  
• Trees with minimum general Randic index, MATCH Communications in Mathematical and in Computer Chemistry 52(2004). SCI. (with Y.M. Hu and Y. Yuan).
  
  
• Integral complete r-partite graphs, Discrete Math. 283(1-3)(2004). SCI, EI. (with L.G. Wang and C. Hoede).
  
  
• Computing the rapture degrees of graphs, IEEE Computer Society, Proc. ISPAN'2004. EI. (with F.W. Li).
  
  
• Binary construction of quantum codes of minimum distance three and four, IEEE Transaction on Information Theory 50(6)(2004). SCI, EI. (with R.H. Li).
  
  
• Quantum codes constructed from binary cyclic codes, International Journal of Quantum Information 2(2)(2004). SCI. (with R.H. Li).
  
  
• The minimum all-ones problem for trees, SIAM J. Computing 33(2)(2004). SCI, EI. (with William Y.C. Chen, C. Wang and X.Y. Zhang).
  
  
• Sharp bounds for the general Randic index, MATCH Communications in Mathematical and in Computer Chemistry 51(2004). SCI. (with Y.T. Yang).
  
  
• Trees with small Randic connectivity indices, MATCH Communications in Mathematical and in Computer Chemistry 51(2004). SCI. (with H.X. Zhao).
  
  
• The edge split reconstruction problem for chemical trees is NP-complete, MATCH Communications in Mathematical and in Computer Chemistry 51(2004). SCI. (with X.Y. Zhang).
  
  
• On a conjecture on k-walks of graphs, Australasian J. Combin. 29(2004). (with Z.M. Jin).
  
  
• On the minimum real roots of the sigma-polynomials and chromatic uniqueness of graphs, Discrete Math. 281(1-3)(2004). SCI, EI. (with H.X. Zhao, S.G. Zhang and R.Y. Liu).
  
  
• Families of integral trees with diameters 4, 6 and 8, Discrete Applied Math. 136(2-3)(2004). SCI, EI. (with L.G. Wang and S.G. Zhang).
  
  
• Eigenvalues of a special kind of symmetric block circulant matrices, Appl. Math. J. Chinese Univ. Ser.B 19(2004). (with L.G. Wang and C. Hoede).
  
  
• Trees with the first three smallest and largest generalized topological indices, MATCH Communications in Mathematical and in Computer Chemistry 50(2004). SCI. (with H.X. Zhao).
  
  
• The inverse problem for indices of molecular graphs, Computers and Applied Chemistry 21(2)(2004), 269-274. (with R.L. Lang and S.G. Zhang).
  
  
• A coalitional power value for set games, Acta Mathematicae Applicatae Sinica (English Series) 19(3)(2003). (with H. Sun and S.G. Zhang).
  
  
• The standard property and the monotonic allocation schemes for values in set games, Acta Mathematicae Applicatae Sinica (Chinese Series) 26(3)(2003). (with H. Sun and L.G. Wang).
  
  
• Solutions for two conjectures on the inverse problem of the Wiener index of peptoids, SIAM J. Discrete Math. 17(2)(2003). SCI, EI. (with L.S. Wang).
  
  
• On a tree graph defined by a set of cycles, Discrete Math. 271(1-3)(2003). SCI, EI. (with V. Neumman-Lara and E. Rivera-Campo).
  
  
• The inverse problem for some topological indices in combinatorial chemistry, Journal of Computational Biology 10(1)(2003). SCI. (with Z.M. Li and L.S. Wang).
  
  
• A complete solution to a conjecture on beta-polynomials of graphs, J. Math. Chem. 33(3-4)(2003). SCI. (with H.X. Zhao and L.S. Wang).
  
  
• Inverse problem for Zagreb index of molecular graphs, Appl. Math. J. Chinese Univ. Ser.A 18(4)(2003). (with R.L. Lang and S.G. Zhang).
  
  
• On the roots of sigma-polynomials, Appl. Math. J. Chinese Univ. Ser.B 18(2)(2003). (with H.X. Zhao and R.Y. Liu).
  
  
• Degree sums and subpancyclicity in line graphs, Discrete Math. 242(1-3)(2002). SCI. (with L.M. Xiong, H.J. Broersma and C. Hoede).
  
  
• A Fan-type condition for heavy cycles in weighted graphs, Graphs and Combin. 25(2002). SCI.(with S.G. Zhang, H.J. Broersma and C. Hoede).
  
  
• Computing the scattering number of graphs, International J. Computer Math. 79(2)(2002). SCI. (with S.G. Zhang and X.L. Han).
  
  
• Some approaches to a conjecture on short cycles in digraphs, Discrete Applied Math. 120(1-3)(2002). SCI, EI. (with H.J. Broersma).
  
  
• Isomorphisms and traversability of directed path graphs, Discussiones Math. Graph Theory 22(2)(2002).(with H.J. Broersma).
  
  
• Integral trees with diameters 4,6 and 8, Australasian J. Combin. 25(2002). (with L.G. Wang and X.J. Yao).
  
  
• w-density and w-balanced property of weighted graphs, Appl. Math. J. Chinese Univ. Ser.B 17(3)(2002).(with S.G. Zhang and H. Sun).
  
  
• Further construction of authentication codes with arbitration from unitary geometry, J. Electronics and Information Technology 24(3)(2002).(with R.H. Li and Z.H. Li).
  
  
• A sigma3-type condition for heavy cycles in weighted graphs, Discussiones Math. Graph Theory 21(2)(2001).(with S.G.Zhang and H.J. Broersma).
  
  
• A co-marginalistic contribution value for set games, International Game Theory Review 3(4)(2001).(with H. Sun, S.G. Zhang, Th. Driessen and C. Hoede).
  
  
• More examples and counterexamples for a conjecture of Merrifield and Simmons, Publications de L’Institut Mathematique 69(83)(2001).(with Y. Wang and I. Gutman).
  
  
• Knowledge graph analysis for logic words in natural language processing, J. Chinese Information Processing 15(6)(2001).(with L. Zhang and X.D. Liu).
  
  
• Construction of integral graphs, Appl. Math. J. Chinese Univ. Ser. B 15(3)(2000).(with L.G. Wang and S.G. Zhang ).
  
  
• Heavy paths and cycles in weighted graphs, Discrete Math. 223(2000). SCI, EI. (with S.G. Zhang and H.J. Broersma).
  
  
• Some new classes of integral trees with diameters 4 and 6, Australasian J. Combinatorics 21(2000).(with L.G. Wang).
  
  
• The beta-polynomials of complete graphs are real, Publ. Inst. Math. (Beograd) 67(2000).(with I. Gutman and G.V. Milovanovic).
  
  
• Elementary proof of the reality of the zeros of beta-polynomial of complete graphs, Kragujevac J. Math. 22(2000).(with I. Gutman).
  
  
• Logic words in natural language processing, Mini-Micro Systems 2(2000).EI.(with L. Zhang and X.D. Liu).
  
  
• Classification and representation of Chinese quantity words in knowledge graphs, Mini-Micro Systems 5(2000).EI.(with X.D, Liu and L. Zhang).
  
  
• Edge-disjoint minimum connected spanning k-edge subgraphs of a weighted graph: A connectedness theorem, Discrete Math. 188(1998). SCI, EI.
  
  
• The connectivity of SEE-graphs and AEE-graphs for connected spanning k-edge subgraphs of graphs, Discrete Math. 183(1998). SCI, EI.
  
  
• Semikernels and (k,l)-kernels in the line digraph, SIAM J. Discrete Math. Vol.11, No.2(1998). SCI. (with H. Galeana-Sanchez).
  
  
• Kernels in a special class of digraphs, Discrete Math. 178(1998). SCI, EI.(with H. Galeana-Sanchez).
  
  
• On the determination problem for P3-transformation of graphs, Ars Combinatoria 49(1998). SCI.
  
  
• Isomorphisms of P4-graphs, Australasian J. Combin. 15(1997).(with B. Zhao).
  
  
• Hexagonal systems with forcing single edges, Discrete Appl. Math. 72(1997). SCI, EI.
  
  
• A lower bound for the connectivity of directed Euler tour transformation graphs, Discrete Math. 163(1997). SCI, EI.
  
  
• Spanning trees with many or few colors in edge-colored graph, Discussiones Mathematicae Graph Theory 17(2)(1997).(with H.J. Broersma).
  
  
• A solution to Gutman's problem on the characteristic polynomials of bipartite graphs, Discrete Math. 154(1996). SCI, EI. (with H.P. Zhang).
  
  
• Isomorphisms of P3-graphs, J. Graph Theory 21(1)(1996). SCI.
  
  
• Forcing bonds of a benzenoid system, Acta Math. Appl. Sinica. (English Ser.) 12(2) (1996).(with F.J. Zhang).
  
  
• On a conjecture of Merrifield and Simmons, Australasian J. Combinatorics Vol.14 (1996).
  
  
• Kernels, semikernels and quasikernels in super line digraphs, Graph Theory Notes of New York XXX (1996).(with B. Zhao).
  
  
• Word graphs: The first set, In Conceptual Structures: Knowledge Representation as Interlingua, Proceedings of the 4th International Conference on Conceptual Structures, ICCS'96 (Eds. P. W. Eklund, G. Ellis and G. Mann), August (1996), Sydney, Australia.(with C. Hoede).
  
  
• The connectivity of the leaf-exchange spanning tree graph of a graph, Ars Combinatoria 43(1996). SCI.(with H.J. Broersma).
  
  
• Hexagonal systems with forcing edges, Discrete Math. 140(1995). SCI.(with F.J. Zhang).
  
  
• A unified approach to the first derivative of graph polynomials, Discrete Appl. Math. 58(1995). SCI.(with H.P. Zhang and I. Gutman).
  
  
• More examples for supporting the reality of zeros of beta-polynomials, J. Serb. Chem. Soc. 60(12)(1995).(with B. Zhao and I. Gutman).
  
  
• N-dimensional line digraphs, Discrete Math. 132(1994). SCI.(with F.J. Zhang).
  
  
• A linear algorithm to determine a bond in a benzenoid system with smaller or larger freedom, J. Molecular Structure (Theochem), 312(1994). SCI.
  
  
• The connectivity of path graphs, Proceedings of the Third China-USA International Conference on Graphs and Combinatorics, World Sci. Publ. (1994), Singapore.
  
  
• Clique polynomials and independent set polynomials of graphs, Discrete Math. 125(1994). SCI.(with C. Hoede).
  
  
• Hamiltonicity of a type of interchange graphs, Discrete Appl. Math. 51(1994). SCI.ISTP.(with F.J. Zhang).
  
  
• Topological properties of some novel S,T-isomers (II), MATCH Commun. Math. Comput. Chem. 30(1994).(with E. Vumar).
  
  
• Comparison theorems of some novel S,T-isomers, MATCH Commun. Math. Comput. Chem. 30(1994).(with Y. Liu).
  
  
• The copositive property of a type of cubic forms and an application in the comparison of S,T-isomers, MATCH Commun. Math. Comput. Chem. 30(1994). (with S.L. Zheng).
  
  
• Homomorphisms of n-dimensional line digraphs, Proceedings of SSIC'92, World Sci. Publ., Singapore, May(1993).(with F.J. Zhang).
  
  
• On a formula involving the first derivative of the characteristic polynomial of a graph, Publ. Elek. Tech. Fac. Ser. Math., Belgrade, YU, 4(1993).(with I. Gutman and H.P. Zhang).
  
  
• Hexagonal systems with fixed bonds, Discrete Appl. Math. 47(1993). SCI.(with F.J. Zhang and H.P. Zhang).
  
  
• On "the matching polynomial of a polygraph", Discrete Appl. Math. 46(1993). SCI.EI. (with H.J. Broersma).
  
  
• The connectivity of the basis graph of a branching greedoid, J. Graph Theory, 16(3) (1992). SCI.(with H.J. Broersma).
  
  
• Digraph categories and line digraph functors, Chinese Ann. Math. 13B:3 (1992). SCI.(with F.J. Zhang, Q.H. Huang ang X. Liu).
  
  
• Topological properties of some novel S,T-isomers (I), MATCH Commun. Math. Comput. Chem. 28(1992).(with E. Vumar).
  
  
• On the numbers of spanning trees and Eulerian tours in generalized de Bruijn graphs, Discrete Math. 94(1991). SCI.(with F.J. Zhang).
  
  
• A proof of Balinski and Russakoff's conjecture on the connectivity of assignment polytopes, Chinese Ann. Math. 12A:5 (1991); Chinese J. Contemporary Math. 12(4)(1991).
  
  
• A fast algorithm to determine fixed bonds in hexagonal systems, MATCH Commun. Math. Comput. Chem. 25(1990).(with F.J. Zhang).
  
  
• Hexagonal systems without fixed double bonds, MATCH Commun. Math. Comput. Chem. 25(1990).(with F.J. Zhang).
  
  
• Clar formula of a class of hexagonal systems, MATCH Commun. Math. Comput. Chem. 24(1989). (with F.J. Zhang).
  
  
• On integral trees problems, Chinese Sci. Bulletin 10(1988) (English Edition). SCI. (with G.N. Lin).

Papers in Math Review

Email:  Xueliang Li

This page was last updated on:
June 25, 2008