About: Bondage number

An Entity of Type: Thing, from Named Graph: http://dbpedia.org, within Data Space: dbpedia.org:8891

In the mathematical field of graph theory, the bondage number of a nonempty graph is the cardinality of the smallest set E of edges such that the domination number of the graph with the edges E removed is strictly greater than the domination number of the original graph.The concept was introduced by Fink et al.

Property Value
dbo:abstract
  • In the mathematical field of graph theory, the bondage number of a nonempty graph is the cardinality of the smallest set E of edges such that the domination number of the graph with the edges E removed is strictly greater than the domination number of the original graph.The concept was introduced by Fink et al. (en)
dbo:wikiPageID
  • 43402512 (xsd:integer)
dbo:wikiPageLength
  • 1332 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID
  • 1095355657 (xsd:integer)
dbo:wikiPageWikiLink
dbp:wikiPageUsesTemplate
dcterms:subject
gold:hypernym
rdfs:comment
  • In the mathematical field of graph theory, the bondage number of a nonempty graph is the cardinality of the smallest set E of edges such that the domination number of the graph with the edges E removed is strictly greater than the domination number of the original graph.The concept was introduced by Fink et al. (en)
rdfs:label
  • Bondage number (en)
owl:sameAs
prov:wasDerivedFrom
foaf:isPrimaryTopicOf
is dbo:wikiPageWikiLink of
is foaf:primaryTopic of
Powered by OpenLink Virtuoso    This material is Open Knowledge     W3C Semantic Web Technology     This material is Open Knowledge    Valid XHTML + RDFa
This content was extracted from Wikipedia and is licensed under the Creative Commons Attribution-ShareAlike 3.0 Unported License