Solved Problems in Enumerative Graph Theory - Softcover

Inhaltsangabe

Various problems in the theory of combinatorial and enumerative graph theory are developed across many different topics in the subject. New methods are introduced crossing boundaries with analytic number theory to derive closed formulas for certain classes of graphs.All of the problems discussed have been extended by the author’s research to include a more comprehensive set of graphs than previously known.Section VIII presents a more detailed look into the structure of undirected graphs with the corresponding eigenvalues. It remains an open problem determining whether a semi-Diophantine polynomial has a corresponding graph. This is clear from the fact that two dissimilar matrices can result in the same characteristic equation also implying the possibility that two structurally different graphs can have the same characteristic polynomial.Chapter X presents a series of open and unsolved problems in many different areas of graph theory posed by Paul Erdös. Accompanying these problems is a comprehensive research bibliography.

Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.