Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/Matching_preclusion> ?p ?o }
Showing triples 1 to 38 of
38
with 100 triples per page.
- Matching_preclusion abstract "In graph theory, a branch of mathematics, the matching preclusion number of a graph G (denoted mp(G)) is the minimum number of edges whose deletion results in the destruction of a perfect matching or near-perfect matching (a matching that covers all but one vertex in a graph with an odd number of vertices). Matching preclusion measures the robustness of a graph as a communications network topology for distributed algorithms that require each node of the distributed system to be matched with a neighboring partner node.In many graphs, mp(G) is equal to the minimum degree of any vertex in the graph, because deleting all edges incident to a single vertex prevents it from being matched. This set of edges is called a trivial matching preclusion set. A variant definition, the conditional matching preclusion number, asks for the minimum number of edges the deletion of which results in a graph that has neither a perfect or near-perfect matching nor any isolated vertices.Other numbers defined in a similar way by edge deletion in an undirected graph include the edge connectivity, the minimum number of edges to delete in order to disconnect the graph, and the cyclomatic number, the minimum number of edges to delete in order to eliminate all cycles.".
- Matching_preclusion wikiPageID "27970912".
- Matching_preclusion wikiPageLength "2796".
- Matching_preclusion wikiPageOutDegree "9".
- Matching_preclusion wikiPageRevisionID "581525766".
- Matching_preclusion wikiPageWikiLink Category:Graph_invariants.
- Matching_preclusion wikiPageWikiLink Category:Matching.
- Matching_preclusion wikiPageWikiLink Circuit_rank.
- Matching_preclusion wikiPageWikiLink Communications_network.
- Matching_preclusion wikiPageWikiLink Cyclomatic_number.
- Matching_preclusion wikiPageWikiLink Degree_(graph_theory).
- Matching_preclusion wikiPageWikiLink Distributed_algorithm.
- Matching_preclusion wikiPageWikiLink Edge_connectivity.
- Matching_preclusion wikiPageWikiLink Graph_theory.
- Matching_preclusion wikiPageWikiLink K-edge-connected_graph.
- Matching_preclusion wikiPageWikiLink Matching_(graph_theory).
- Matching_preclusion wikiPageWikiLink Perfect_matching.
- Matching_preclusion wikiPageWikiLink Telecommunications_network.
- Matching_preclusion wikiPageWikiLinkText "Matching preclusion".
- Matching_preclusion wikiPageWikiLinkText "matching preclusion".
- Matching_preclusion hasPhotoCollection Matching_preclusion.
- Matching_preclusion wikiPageUsesTemplate Template:Combin-stub.
- Matching_preclusion wikiPageUsesTemplate Template:Reflist.
- Matching_preclusion subject Category:Graph_invariants.
- Matching_preclusion subject Category:Matching.
- Matching_preclusion hypernym Number.
- Matching_preclusion type Article.
- Matching_preclusion type Article.
- Matching_preclusion type Combinatoric.
- Matching_preclusion type Invariant.
- Matching_preclusion type Object.
- Matching_preclusion comment "In graph theory, a branch of mathematics, the matching preclusion number of a graph G (denoted mp(G)) is the minimum number of edges whose deletion results in the destruction of a perfect matching or near-perfect matching (a matching that covers all but one vertex in a graph with an odd number of vertices).".
- Matching_preclusion label "Matching preclusion".
- Matching_preclusion sameAs m.0ch298w.
- Matching_preclusion sameAs Q17135100.
- Matching_preclusion sameAs Q17135100.
- Matching_preclusion wasDerivedFrom Matching_preclusion?oldid=581525766.
- Matching_preclusion isPrimaryTopicOf Matching_preclusion.