Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 3 of 3
Full-Text Articles in Entire DC Network
Hückel Energy Of A Graph: Its Evolution From Quantum Chemistry To Mathematics, Steven Zimmerman
Hückel Energy Of A Graph: Its Evolution From Quantum Chemistry To Mathematics, Steven Zimmerman
Electronic Theses and Dissertations
The energy of a graph began with German physicist, Erich H¨uckel’s 1931 paper, Quantenttheoretische Beitr¨age zum Benzolproblem. His work developed a method for computing the binding energy of the π-electrons for a certain class of organic molecules. The vertices of the graph represented the carbon atoms while the single edge between each pair of distinct vertices represented the hydrogen bonds between the carbon atoms. In turn, the chemical graphs were represented by an n × n matrix used in solving Schr¨odinger’s eigenvalue/eigenvector equation. The sum of the absolute values of these graph eigenvalues represented the total π-electron energy. The criteria …
Finding Dud Vertices In Defensive Alliances And Secure Sets Using Computational Tools, George Worley Ii
Finding Dud Vertices In Defensive Alliances And Secure Sets Using Computational Tools, George Worley Ii
Electronic Theses and Dissertations
Defensive alliances are a way of using graphs to model the defense of resources (people, buildings, countries, etc.) against attacks where the number of potential attackers against each resource is known. The initial study of defensive alliances focused on questions of minimal defensive alliances in a graph and the minimum possible size of a defensive alliance in a graph, but in order to apply defensive alliances in modeling real-world situations, additional considerations are important. In particular, since each vertex in a defensive alliance represents some real-world object that has a cost associated with remaining in the defensive alliance, it is …
Global Secure Sets Of Trees And Grid-Like Graphs, Yiu Yu Ho
Global Secure Sets Of Trees And Grid-Like Graphs, Yiu Yu Ho
Electronic Theses and Dissertations
Let G = (V, E) be a graph and let S ⊆ V be a subset of vertices. The set S is a defensive alliance if for all x ∈ S, |N[x] ∩ S| ≥ |N[x] − S|. The concept of defensive alliances was introduced in [KHH04], primarily for the modeling of nations in times of war, where allied nations are in mutual agreement to join forces if any one of them is attacked. For a vertex x in a defensive alliance, the number of neighbors of x inside the alliance, plus the vertex x, is at least the number …