Premium
Cover Image, Volume 113, Issue 8
Publication year - 2013
Publication title -
international journal of quantum chemistry
Language(s) - English
Resource type - Reports
SCImago Journal Rank - 0.484
H-Index - 105
eISSN - 1097-461X
pISSN - 0020-7608
DOI - 10.1002/qua.24424
Subject(s) - spanning tree , cover (algebra) , computer science , minimum spanning tree , vertex (graph theory) , combinatorics , graph , citation , theoretical computer science , information retrieval , mathematics , algorithm , world wide web , engineering , mechanical engineering
For a (molecular) graph G, a spanning tree in G is a tree that has the same vertex set as G. In the cover image, green edges show a spanning tree. The number of spanning trees in a (molecular) graph has lots of intriguing applications in mathematics, computer science, physics, and chemistry. Because of these wide‐ranging applications, it is important to develop useful techniques for enumerating the number of spanning trees in various classes of graphs. The paper by Khodakhast Bibak on page 1209 deals with a special case, which might be of particular interest to computational quantum chemistry.