• Login
    View Item 
    •   Home
    • Brock Theses
    • Masters Theses
    • M.Sc. Mathematics and Statistics
    • View Item
    •   Home
    • Brock Theses
    • Masters Theses
    • M.Sc. Mathematics and Statistics
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Browse

    All of BrockUCommunitiesPublication DateAuthorsTitlesSubjectsThis CollectionPublication DateAuthorsTitlesSubjectsProfilesView

    My Account

    LoginRegister

    Statistics

    Display statistics

    Square Root Finding In Graphs

    • CSV
    • RefMan
    • EndNote
    • BibTex
    • RefWorks
    Thumbnail
    Name:
    Brock_Karimi_Majid_2012.pdf
    Size:
    1.662Mb
    Format:
    PDF
    Download
    Author
    Karimi, Majid
    Keyword
    Graph Powers, Graph Roots, NP-completeness.
    
    Metadata
    Show full item record
    URI
    http://hdl.handle.net/10464/4190
    Abstract
    Abstract: Root and root finding are concepts familiar to most branches of mathematics. In graph theory, H is a square root of G and G is the square of H if two vertices x,y have an edge in G if and only if x,y are of distance at most two in H. Graph square is a basic operation with a number of results about its properties in the literature. We study the characterization and recognition problems of graph powers. There are algorithmic and computational approaches to answer the decision problem of whether a given graph is a certain power of any graph. There are polynomial time algorithms to solve this problem for square of graphs with girth at least six while the NP-completeness is proven for square of graphs with girth at most four. The girth-parameterized problem of root fining has been open in the case of square of graphs with girth five. We settle the conjecture that recognition of square of graphs with girth 5 is NP-complete. This result is providing the complete dichotomy theorem for square root finding problem.
    Collections
    M.Sc. Mathematics and Statistics

    entitlement

     
    DSpace software (copyright © 2002 - 2023)  DuraSpace
    Quick Guide | Contact Us
    Open Repository is a service operated by 
    Atmire NV
     

    Export search results

    The export option will allow you to export the current search results of the entered query to a file. Different formats are available for download. To export the items, click on the button corresponding with the preferred download format.

    By default, clicking on the export buttons will result in a download of the allowed maximum amount of items.

    To select a subset of the search results, click "Selective Export" button and make a selection of the items you want to export. The amount of items that can be exported at once is similarly restricted as the full export.

    After making a selection, click one of the export format buttons. The amount of items that will be exported is indicated in the bubble next to export format.