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

    Aspects of graph vulnerability.

    Thumbnail
    View/Open
    Day_Peter_David_1994.pdf (4.550Mb)
    Date
    1994
    Author
    Day, David Peter.
    Metadata
    Show full item record
    Abstract
    This dissertation details the results of an investigation into, primarily, three aspects of graph vulnerability namely, l-connectivity, Steiner Distance hereditatiness and functional isolation. Following the introduction in Chapter one, Chapter two focusses on the l-connectivity of graphs and introduces the concept of the strong l-connectivity of digraphs. Bounds on this latter parameter are investigated and then the l-connectivity function of particular types of graphs, namely caterpillars and complete multipartite graphs as well as the strong l-connectivity function of digraphs, is explored. The chapter concludes with an examination of extremal graphs with a given l-connectivity. Chapter three investigates Steiner distance hereditary graphs. It is shown that if G is 2-Steiner distance hereditary, then G is k-Steiner distance hereditary for all k≥2. Further, it is shown that if G is k-Steiner distance hereditary (k≥ 3), then G need not be (k - l)-Steiner distance hereditary. An efficient algorithm for determining the Steiner distance of a set of k vertices in a k-Steiner distance hereditary graph is discussed and a characterization of 2-Steiner distance hereditary graphs is given which leads to an efficient algorithm for testing whether a graph is 2-Steiner distance hereditary. Some general properties about the cycle structure of k-Steiner distance hereditary graphs are established and are then used to characterize 3-Steiner distance hereditary graphs. Chapter four contains an investigation of functional isolation sequences of supply graphs. The concept of the Ranked supply graph is introduced and both necessary and sufficient conditions for a sequence of positive nondecreasing integers to be a functional isolation sequence of a ranked supply graph are determined.
    URI
    http://hdl.handle.net/10413/4864
    Collections
    • Doctoral Degrees (Applied Mathematics) [37]

    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