About: Vizing's conjecture     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : yago:Speculation105891783, within Data Space : dbpedia.demo.openlinksw.com associated with source document(s)
QRcode icon
http://dbpedia.demo.openlinksw.com/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FVizing%27s_conjecture&invfp=IFP_OFF&sas=SAME_AS_OFF

In graph theory, Vizing's conjecture concerns a relation between the domination number and the cartesian product of graphs. This conjecture was first stated by Vadim G. Vizing, and states that, if γ(G) denotes the minimum number of vertices in a dominating set for the graph G, then conjectured a similar bound for the domination number of the tensor product of graphs; however, a counterexample was found by . Since Vizing proposed his conjecture, many mathematicians have worked on it, with partial results described below. For a more detailed overview of these results, see .

AttributesValues
rdf:type
rdfs:label
  • Vizing's conjecture (en)
  • Гипотеза Визинга (ru)
rdfs:comment
  • In graph theory, Vizing's conjecture concerns a relation between the domination number and the cartesian product of graphs. This conjecture was first stated by Vadim G. Vizing, and states that, if γ(G) denotes the minimum number of vertices in a dominating set for the graph G, then conjectured a similar bound for the domination number of the tensor product of graphs; however, a counterexample was found by . Since Vizing proposed his conjecture, many mathematicians have worked on it, with partial results described below. For a more detailed overview of these results, see . (en)
  • Гипотеза Визинга — предположение о связи доминирующего множества и прямого произведения графов, не подтверждённое по состоянию на 2017 год, при этом гипотеза доказана для ряда частных случаев. Впервые была высказана Вадимом Визингом. Утверждение гипотезы гласит, что для — минимального числа вершин в доминирующем множестве графа , выполнено: . В 1995 году предположены аналогичные границы для доминирующего числа тензорного произведения графов, однако позже найден контрпример. (ru)
foaf:depiction
  • http://commons.wikimedia.org/wiki/Special:FilePath/Star_product_domination.svg
dcterms:subject
Wikipage page ID
Wikipage revision ID
Link from a Wikipage to another Wikipage
Link from a Wikipage to an external page
sameAs
dbp:wikiPageUsesTemplate
thumbnail
authorlink
  • Vadim G. Vizing (en)
first
  • Vadim G. (en)
last
  • Vizing (en)
title
  • Vizing Conjecture (en)
urlname
  • VizingConjecture (en)
year
has abstract
  • In graph theory, Vizing's conjecture concerns a relation between the domination number and the cartesian product of graphs. This conjecture was first stated by Vadim G. Vizing, and states that, if γ(G) denotes the minimum number of vertices in a dominating set for the graph G, then conjectured a similar bound for the domination number of the tensor product of graphs; however, a counterexample was found by . Since Vizing proposed his conjecture, many mathematicians have worked on it, with partial results described below. For a more detailed overview of these results, see . (en)
  • Гипотеза Визинга — предположение о связи доминирующего множества и прямого произведения графов, не подтверждённое по состоянию на 2017 год, при этом гипотеза доказана для ряда частных случаев. Впервые была высказана Вадимом Визингом. Утверждение гипотезы гласит, что для — минимального числа вершин в доминирующем множестве графа , выполнено: . В 1995 году предположены аналогичные границы для доминирующего числа тензорного произведения графов, однако позже найден контрпример. (ru)
prov:wasDerivedFrom
page length (characters) of wiki page
foaf:isPrimaryTopicOf
is Link from a Wikipage to another Wikipage of
is Wikipage redirect of
is foaf:primaryTopic of
Faceted Search & Find service v1.17_git139 as of Feb 29 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 08.03.3330 as of Mar 19 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (378 GB total memory, 67 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software