• Login
    View Item 
    •   Carroll Scholars Home
    • Carroll College Student Undergraduate Research Festival
    • Carroll College Student Undergraduate Research Festival 2018-2019
    • View Item
    •   Carroll Scholars Home
    • Carroll College Student Undergraduate Research Festival
    • Carroll College Student Undergraduate Research Festival 2018-2019
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Classifications of Resistance Distances in Simple Graphs

    Thumbnail
    Author
    Randall, Marcellus
    Date of Issue
    2018-04-20
    Metadata
    Show full item record
    URI
    https://scholars.carroll.edu/handle/20.500.12647/7083
    Title
    Classifications of Resistance Distances in Simple Graphs
    Abstract
    Within graph theory, there are multiple distance metrics which can describe the concept of “distance” between nodes on a simple graph, which are of particular interest to researchers studying link prediction and network evolution. This talk will focus on the relationship between measures of distance in simple graphs and various features of these graphs. I will discuss classifying graphs in which any edge resistance is greater than any non-edge resistance, using Katz centrality scores and classical graph theoretical features.
    Collections
    • Carroll College Student Undergraduate Research Festival 2018-2019

    Browse

    All of Carroll ScholarsCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

    My Account

    LoginRegister

    DSpace software copyright © 2002-2023  DuraSpace
    DSpace Express is a service operated by 
    Atmire NV