Li, X. (Xueliang) 1958
Overview
Works:  44 works in 120 publications in 1 language and 1,575 library holdings 

Genres:  Conference papers and proceedings Academic theses 
Roles:  Author, Editor, htt, Other 
Classifications:  QA167, 516.13 
Publication Timeline
.
Most widely held works by
X Li
Rainbow connections of graphs by
X Li(
)
16 editions published in 2012 in English and held by 456 WorldCat member libraries worldwide
<P>Rainbow connections are natural combinatorial measures that are used in applications to secure the transfer of classified information between agencies in communication networks. <i>Rainbow Connections of Graphs</i> covers this new and emerging topic in graph theory and brings together a majority of the results that deal with the concept of rainbow connections, first introduced by Chartrand et al. in 2006. </p><p>The authors begin with an introduction to rainbow connectedness, rainbow coloring, and rainbow connection number. The work is organized into the following categories, computation of the exact values of the rainbow connection numbers for some special graphs, algorithms and complexity analysis, upper bounds in terms of other graph parameters, rainbow connection for dense and sparse graphs, for some graph classes and graph products, rainbow kconnectivity and krainbow index, and, rainbow vertexconnection number.<br><br><i>Rainbow Connections of Graphs</i> appeals to researchers and graduate students in the field of graph theory. Conjectures, open problems and questions are given throughout the text with the hope for motivating young graph theorists and graduate students to do further study in this subject. <br><br><br></p><p>
16 editions published in 2012 in English and held by 456 WorldCat member libraries worldwide
<P>Rainbow connections are natural combinatorial measures that are used in applications to secure the transfer of classified information between agencies in communication networks. <i>Rainbow Connections of Graphs</i> covers this new and emerging topic in graph theory and brings together a majority of the results that deal with the concept of rainbow connections, first introduced by Chartrand et al. in 2006. </p><p>The authors begin with an introduction to rainbow connectedness, rainbow coloring, and rainbow connection number. The work is organized into the following categories, computation of the exact values of the rainbow connection numbers for some special graphs, algorithms and complexity analysis, upper bounds in terms of other graph parameters, rainbow connection for dense and sparse graphs, for some graph classes and graph products, rainbow kconnectivity and krainbow index, and, rainbow vertexconnection number.<br><br><i>Rainbow Connections of Graphs</i> appeals to researchers and graduate students in the field of graph theory. Conjectures, open problems and questions are given throughout the text with the hope for motivating young graph theorists and graduate students to do further study in this subject. <br><br><br></p><p>
Graph energy by
X Li(
)
12 editions published in 2012 in English and held by 435 WorldCat member libraries worldwide
Annotation
12 editions published in 2012 in English and held by 435 WorldCat member libraries worldwide
Annotation
Generalized connectivity of graphs by
X Li(
)
13 editions published in 2016 in English and held by 277 WorldCat member libraries worldwide
Noteworthy results, proof techniques, open problems and conjectures in generalized (edge ) connectivity are discussed in this book. Both theoretical and practical analyses for generalized (edge ) connectivity of graphs are provided. Topics covered in this book include: generalized (edge ) connectivity of graph classes, algorithms, computational complexity, sharp bounds, NordhausGaddumtype results, maximum generalized local connectivity, extremal problems, random graphs, multigraphs, relations with the Steiner tree packing problem and generalizations of connectivity. This book enables graduate students to understand and master a segment of graph theory and combinatorial optimization. Researchers in graph theory, combinatorics, combinatorial optimization, probability, computer science, discrete algorithms, complexity analysis, network design, and the information transferring models will find this book useful in their studies
13 editions published in 2016 in English and held by 277 WorldCat member libraries worldwide
Noteworthy results, proof techniques, open problems and conjectures in generalized (edge ) connectivity are discussed in this book. Both theoretical and practical analyses for generalized (edge ) connectivity of graphs are provided. Topics covered in this book include: generalized (edge ) connectivity of graph classes, algorithms, computational complexity, sharp bounds, NordhausGaddumtype results, maximum generalized local connectivity, extremal problems, random graphs, multigraphs, relations with the Steiner tree packing problem and generalizations of connectivity. This book enables graduate students to understand and master a segment of graph theory and combinatorial optimization. Researchers in graph theory, combinatorics, combinatorial optimization, probability, computer science, discrete algorithms, complexity analysis, network design, and the information transferring models will find this book useful in their studies
Properly colored connectivity of graphs by
X Li(
)
14 editions published in 2018 in English and held by 221 WorldCat member libraries worldwide
A comprehensive survey of proper connection of graphs is discussed in this book with real world applications in computer science and network security. Beginning with a brief introduction, comprising relevant definitions and preliminary results, this book moves on to consider a variety of properties of graphs that imply bounds on the proper connection number. Detailed proofs of significant advancements toward open problems and conjectures are presented with complete references. Researchers and graduate students with an interest in graph connectivity and colorings will find this book useful as it builds upon fundamental definitions towards modern innovations, strategies, and techniques. The detailed presentation lends to use as an introduction to proper connection of graphs for new and advanced researchers, a solid book for a graduate level topics course, or as a reference for those interested in expanding and further developing research in the area
14 editions published in 2018 in English and held by 221 WorldCat member libraries worldwide
A comprehensive survey of proper connection of graphs is discussed in this book with real world applications in computer science and network security. Beginning with a brief introduction, comprising relevant definitions and preliminary results, this book moves on to consider a variety of properties of graphs that imply bounds on the proper connection number. Detailed proofs of significant advancements toward open problems and conjectures are presented with complete references. Researchers and graduate students with an interest in graph connectivity and colorings will find this book useful as it builds upon fundamental definitions towards modern innovations, strategies, and techniques. The detailed presentation lends to use as an introduction to proper connection of graphs for new and advanced researchers, a solid book for a graduate level topics course, or as a reference for those interested in expanding and further developing research in the area
Discrete geometry, combinatorics and graph theory : 7th ChinaJapan conference, CJCDGCGT 2005, Tianjin, China, November 1820,
2005 [and] Xi'an, China, November 2224, 2005 : revised selected papers by
J Akiyama(
)
12 editions published in 2007 in English and Undetermined and held by 58 WorldCat member libraries worldwide
This book constitutes the thoroughly refereed postproceedings of the 7th ChinaJapan Conference on Discrete Geometry, Combinatorics and Graph Theory, CJCDGCGT 2005, held in Tianjin, China, as well as in Xi'an, China, in November 2005. The 30 revised full papers presented were carefully selected during two rounds of reviewing and improvement from over 60 talks at the conference. All current issues in discrete algorithmic geometry, combinatorics and graph theory are addressed
12 editions published in 2007 in English and Undetermined and held by 58 WorldCat member libraries worldwide
This book constitutes the thoroughly refereed postproceedings of the 7th ChinaJapan Conference on Discrete Geometry, Combinatorics and Graph Theory, CJCDGCGT 2005, held in Tianjin, China, as well as in Xi'an, China, in November 2005. The 30 revised full papers presented were carefully selected during two rounds of reviewing and improvement from over 60 talks at the conference. All current issues in discrete algorithmic geometry, combinatorics and graph theory are addressed
Mathematical foundations and applications of graph entropy(
)
3 editions published in 2016 in English and held by 40 WorldCat member libraries worldwide
This latest addition to the successful Network Biology series presents current methods for determining the entropy of networks, making it the first to cover the recently established Quantitative Graph Theory. An excellent international team of editors and contributors provides an uptodate outlook for the field, covering a broad range of graph entropyrelated concepts and methods. The topics range from analyzing mathematical properties of methods right up to applying them in reallife areas. Filling a gap in the contemporary literature this is an invaluable reference for a number of disciplines, including mathematicians, computer scientists, computational biologists, and structural chemists
3 editions published in 2016 in English and held by 40 WorldCat member libraries worldwide
This latest addition to the successful Network Biology series presents current methods for determining the entropy of networks, making it the first to cover the recently established Quantitative Graph Theory. An excellent international team of editors and contributors provides an uptodate outlook for the field, covering a broad range of graph entropyrelated concepts and methods. The topics range from analyzing mathematical properties of methods right up to applying them in reallife areas. Filling a gap in the contemporary literature this is an invaluable reference for a number of disciplines, including mathematicians, computer scientists, computational biologists, and structural chemists
Transformation graphs by
X Li(
Book
)
1 edition published in 1991 in English and held by 12 WorldCat member libraries worldwide
1 edition published in 1991 in English and held by 12 WorldCat member libraries worldwide
Some approaches to a conjecture on short cycles in digraphs by
Hajo Broersma(
Book
)
3 editions published in 1998 in English and held by 4 WorldCat member libraries worldwide
3 editions published in 1998 in English and held by 4 WorldCat member libraries worldwide
Heavy paths and cycles in weighted graphs by
Shenggui Zhang(
Book
)
3 editions published in 1998 in English and held by 3 WorldCat member libraries worldwide
3 editions published in 1998 in English and held by 3 WorldCat member libraries worldwide
Directed paths with few or many colors in colored directed graphs by
X Li(
Book
)
1 edition published in 2000 in English and held by 3 WorldCat member libraries worldwide
1 edition published in 2000 in English and held by 3 WorldCat member libraries worldwide
Energies of graphs : theory and applications by
Ivan Gutman(
Book
)
3 editions published in 2016 in English and held by 3 WorldCat member libraries worldwide
3 editions published in 2016 in English and held by 3 WorldCat member libraries worldwide
Isomorphisms and traversability of directed path graphs by
Hajo Broersma(
Book
)
3 editions published in 1998 in English and held by 3 WorldCat member libraries worldwide
3 editions published in 1998 in English and held by 3 WorldCat member libraries worldwide
Clique polynomials and independent set polynomials of graphs by
C Hoede(
Book
)
1 edition published in 1991 in English and held by 3 WorldCat member libraries worldwide
1 edition published in 1991 in English and held by 3 WorldCat member libraries worldwide
NDimensional line digraphs by
X Li(
Book
)
2 editions published in 1991 in Undetermined and English and held by 2 WorldCat member libraries worldwide
2 editions published in 1991 in Undetermined and English and held by 2 WorldCat member libraries worldwide
Conflictfree connection of trees by Hong Chang(
)
1 edition published in 2018 in English and held by 2 WorldCat member libraries worldwide
1 edition published in 2018 in English and held by 2 WorldCat member libraries worldwide
Some extremal results on the colorful monochromatic vertexconnectivity of a graph by Qingqiong Cai(
)
1 edition published in 2018 in English and held by 2 WorldCat member libraries worldwide
1 edition published in 2018 in English and held by 2 WorldCat member libraries worldwide
A note on "the matching polynomial of a polygraph" by
Hajo Broersma(
Book
)
1 edition published in 1990 in English and held by 2 WorldCat member libraries worldwide
1 edition published in 1990 in English and held by 2 WorldCat member libraries worldwide
NordhausGaddumType Theorem for TotalProper Connection Number of Graphs by Wenjing Li(
)
1 edition published in 2017 in English and held by 2 WorldCat member libraries worldwide
1 edition published in 2017 in English and held by 2 WorldCat member libraries worldwide
On (Strong) Proper VertexConnection of Graphs by Hui Jiang(
)
1 edition published in 2015 in English and held by 2 WorldCat member libraries worldwide
1 edition published in 2015 in English and held by 2 WorldCat member libraries worldwide
Graphs with ConflictFree Connection Number Two by Hong Chang(
)
1 edition published in 2018 in English and held by 2 WorldCat member libraries worldwide
1 edition published in 2018 in English and held by 2 WorldCat member libraries worldwide
more
fewer
Audience Level
0 

1  
General  Special 
Related Identities
 Sun, Yuefang Author
 Shi, Yongtang Editor
 Gutman, Ivan 1947 Editor
 Mao, Yaping
 Qin, Zhongmei Other
 Magnant, Colton Other
 Akiyama, Jin Author Editor
 Chen, William Y. C. Editor
 Yu, Qinglin Editor
 Kano, Mikio Editor
Associated Subjects
Algebra Algorithms ChemistryMathematics Combinatorial analysis Combinatorial geometry Computational complexity Computer graphics Computer science Computer scienceMathematics Computer software Convex geometry Data structures (Computer science) Discrete geometry Discrete geometryData processing Discrete groups Eigenvalues Entropy (Information theory) Geometry, Differential Graph connectivity Graph theory Management science Mathematics Number theory Operations research
Covers
Alternative Names
Li 1958 Xueliang
Li, Hsüehliang
Li, Hsünching.
Li, X.
Li, X. 1958
Li, Xueliang
Li, Xueliang 1958
Xueliang Li.
リ, ガクリョウ
李学亮
李学良
Languages