Yongtang Shi – författare

This book covers both theoretical and practical results for graph polynomials. Graph polynomials have been developed for measuring combinatorial graph invariants and for characterizing graphs. Various problems in pure and applied graph theory or discrete mathematics can be treated and solved efficiently by using graph polynomials. Graph polynomials have been proven useful areas such as discrete mathematics, engineering, information sciences, mathematical chemistry and related disciplines.

Modern and Interdisciplinary Problems in Network Science: A Translational Research Perspective covers a broad range of concepts and methods, with a strong emphasis on interdisciplinarity. The topics range from analyzing mathematical properties of network-based methods to applying them to application areas. By covering this broad range of topics, the book aims to fill a gap in the contemporary literature in disciplines such as physics, applied mathematics and information sciences.

Modern and Interdisciplinary Problems in Network Science: A Translational Research Perspective covers a broad range of concepts and methods, with a strong emphasis on interdisciplinarity. The topics range from analyzing mathematical properties of network-based methods to applying them to application areas. By covering this broad range of topics, the book aims to fill a gap in the contemporary literature in disciplines such as physics, applied mathematics and information sciences.

This book is about graph energy. The authors have included many of the important results on graph energy, such as the complete solution to the conjecture on maximal energy of unicyclic graphs, the Wagner-Heuberger’s result on the energy of trees, the energy of random graphs or the approach to energy using singular values. It contains an extensive coverage of  recent results and a gradual development of topics and the inclusion of complete proofs from most of the important recent results in the area. The latter fact makes it a valuable reference for researchers looking to get into the field of graph energy, further stimulating it with occasional inclusion of open problems. The book provides a comprehensive survey of all results and common proof methods obtained in this field with an extensive reference section. The book is aimed mainly towards mathematicians, both researchers and doctoral students, with interest in the field of mathematical chemistry.

This book covers both theoretical and practical results for graph polynomials. Graph polynomials have been developed for measuring combinatorial graph invariants and for characterizing graphs. Various problems in pure and applied graph theory or discrete mathematics can be treated and solved efficiently by using graph polynomials. Graph polynomials have been proven useful areas such as discrete mathematics, engineering, information sciences, mathematical chemistry and related disciplines.