Repository landing page

We are not able to resolve this OAI Identifier to the repository landing page. If you are the repository manager for this record, please head to the Dashboard and adjust the settings.
oaioai:digitalcommons.georgiasouthern.edu:tag-1074

Matching Preclusion of the Generalized Petersen Graph

Authors
Publication date
1 May 2019
Publisher
Digital Commons@Georgia Southern
Doi

    Abstract

    The matching preclusion number of a graph with an even number of vertices is the minimum number of edges whose deletion results in a graph with no perfect matchings. In this paper we determine the matching preclusion number for the generalized Petersen graph P(n,k) and classify the optimal sets

    Similar works

    Full text

    thumbnail-image

    Georgia Southern University: Digital Commons@Georgia Southern

    redirect
    oaioai:digitalcommons.georgiasout...
    Last time updated on 17/10/2019

    This paper was published in Georgia Southern University: Digital Commons@Georgia Southern.

    Having an issue?

    Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.