Survey of Graph Energies
Authors
Abstract:
Let graph energy is a graph--spectrum--based quantity, introduced in the 1970s. After a latent period of 20--30 years, it became a popular topic of research both in mathematical chemistry and in ``pure'' spectral graph theory, resulting in over 600 published papers. Eventually, scores of different graph energies have been conceived. In this article we provide the basic facts on graph energies, in particular historical and bibliographic data.
similar resources
dynamic coloring of graph
در این پایان نامه رنگ آمیزی دینامیکی یک گراف را بیان و مطالعه می کنیم. یک –kرنگ آمیزی سره ی رأسی گراف g را رنگ آمیزی دینامیکی می نامند اگر در همسایه های هر رأس v?v(g) با درجه ی حداقل 2، حداقل 2 رنگ متفاوت ظاهر شوند. کوچکترین عدد صحیح k، به طوری که g دارای –kرنگ آمیزی دینامیکی باشد را عدد رنگی دینامیکی g می نامند و آنرا با نماد ?_2 (g) نمایش می دهند. مونت گمری حدس زده است که تمام گراف های منتظم ...
15 صفحه اولLearning molecular energies using localized graph kernels.
Recent machine learning methods make it possible to model potential energy of atomic configurations with chemical-level accuracy (as calculated from ab initio calculations) and at speeds suitable for molecular dynamics simulation. Best performance is achieved when the known physical constraints are encoded in the machine learning models. For example, the atomic energy is invariant under global ...
full textA Survey of Energies in Materials Science
A table is presented that compares energies that govern a variety of phenomena in materials science: thermal, structural and chemical energies; energies associated with the formation of vacancies, dislocations and interfaces; energies associated with the application of an external load, strain, magnetic field, or supersaturation. A simple argument, based on the polytetrahedral nature of the str...
full textSurvey of Graph Matching Algorithms
Graph matching problems of varying types are important in a wide array of application areas. A graph matching problem is a problem involving some form of comparison between graphs. Some of the many application areas of such problems include information retrieval, sub-circuit identification, chemical structure classification, and networks. Problems of efficient graph matching arise in any field ...
full textA Survey of Graph Pebbling
We survey results on the pebbling numbers of graphs as well as their historical connection with a number-theoretic question of Erdős and Lemke. We also present new results on two probabilistic pebbling considerations, first the random graph threshold for the property that the pebbling number of a graph equals its number of vertices, and second the pebbling threshold function for various natural...
full textMy Resources
Journal title
volume 2 issue 2
pages 85- 129
publication date 2017-12-01
By following a journal you will be notified via email when a new issue of this journal is published.
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023