This Is AuburnElectronic Theses and Dissertations

Show simple item record

Fractional Domination, Fractional Packings, and Fractional Isomorphisms of Graphs


Metadata FieldValueLanguage
dc.contributor.advisorJohnson, Peter
dc.contributor.advisorRodger, Chrisen_US
dc.contributor.advisorWalsh, Matthewen_US
dc.contributor.advisorHoffman, Deanen_US
dc.contributor.authorRubalcaba, Roberten_US
dc.date.accessioned2008-09-09T22:33:46Z
dc.date.available2008-09-09T22:33:46Z
dc.date.issued2005-05-15en_US
dc.identifier.urihttp://hdl.handle.net/10415/1030
dc.description.abstractThe fractional analogues of domination and packing in a graph form an interesting pair of dual linear programs, in that the feasible vectors for both LPs have interpretations as functions from the vertices of the graph to the unit interval. The relationships between the solution sets of these dual problems are investigated. Another pair of dual linear programs, the fractional analogues of total domination and open packing in a graph, also both have interpretations as functions from the vertices to the unit interval. The relationships between the solution sets of these dual problems are also investigated. The fractional analogue of graph isomorphism plays a role in both investigations. Finally, various military strategies are discussed, as well as their fractional analogues.en_US
dc.language.isoen_USen_US
dc.subjectMathematicsen_US
dc.titleFractional Domination, Fractional Packings, and Fractional Isomorphisms of Graphsen_US
dc.typeDissertationen_US
dc.embargo.lengthNO_RESTRICTIONen_US
dc.embargo.statusNOT_EMBARGOEDen_US

Files in this item

Show simple item record