• Login
    View Item 
    •   ResearchSpace Home
    • College of Agriculture, Engineering and Science
    • School Mathematics, Statistics and Computer Science
    • Pure Mathematics
    • Masters Degrees (Pure Mathematics)
    • View Item
    •   ResearchSpace Home
    • College of Agriculture, Engineering and Science
    • School Mathematics, Statistics and Computer Science
    • Pure Mathematics
    • Masters Degrees (Pure Mathematics)
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Parameters related to fractional domination in graphs.

    Thumbnail
    View/Open
    Thesis (3.501Mb)
    Date
    1995
    Author
    Erwin, D. J.
    Metadata
    Show full item record
    Abstract
    The use of characteristic functions to represent well-known sets in graph theory such as dominating, irredundant, independent, covering and packing sets - leads naturally to fractional versions of these sets and corresponding fractional parameters. Let S be a dominating set of a graph G and f : V(G)~{0,1} the characteristic function of that set. By first translating the restrictions which define a dominating set from a set-based to a function-based form, and then allowing the function f to map the vertex set to the unit closed interval, we obtain the fractional generalisation of the dominating set S. In chapter 1, known domination-related parameters and their fractional generalisations are introduced, relations between them are investigated, and Gallai type results are derived. Particular attention is given to graphs with symmetry and to products of graphs. If instead of replacing the function f : V(G)~{0,1} with a function which maps the vertex set to the unit closed interval we introduce a function f' which maps the vertex set to {0, 1, ... ,k} (where k is some fixed, non-negative integer) and a corresponding change in the restrictions on the dominating set, we obtain a k-dominating function. In chapter 2 corresponding k-parameters are considered and are related to the classical and fractional parameters. The calculations of some well known fractional parameters are expressed as optimization problems involving the k- parameters. An e = 1 function is a function f : V(G)~[0,1] which obeys the restrictions that (i) every non-isolated vertex u is adjacent to some vertex v such that f(u)+f(v) = 1, and every isolated vertex w has f(w) = 1. In chapter 3 a theory of e = 1 functions and parameters is developed. Relationships are traced between e = 1 parameters and those previously introduced, some Gallai type results are derived for the e = 1 parameters, and e = 1 parameters are determined for several classes of graphs. The e = 1 theory is applied to derive new results about classical and fractional domination parameters.
    URI
    http://hdl.handle.net/10413/4888
    Collections
    • Masters Degrees (Pure Mathematics) [26]

    DSpace software copyright © 2002-2013  Duraspace
    Contact Us | Send Feedback
    Theme by 
    @mire NV
     

     

    Browse

    All of ResearchSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsAdvisorsTypeThis CollectionBy Issue DateAuthorsTitlesSubjectsAdvisorsType

    My Account

    LoginRegister

    DSpace software copyright © 2002-2013  Duraspace
    Contact Us | Send Feedback
    Theme by 
    @mire NV