Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Vizing's_conjecture> ?p ?o. }
Showing items 1 to 38 of
38
with 100 items per page.
- Vizing's_conjecture 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 (1968), and states that, if γ(G) denotes the minimum number of vertices in a dominating set for G, thenγ(G ◻ H) ≥ γ(G)γ(H).Gravier & Khelladi (1995) conjectured a similar bound for the domination number of the tensor product of graphs; however, a counterexample was found by Klavžar & Zmazek (1996). 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 Imrich & Klavžar (2000).".
- Vizing's_conjecture thumbnail Star_product_domination.svg?width=300.
- Vizing's_conjecture wikiPageExternalLink v7i1n4.html.
- Vizing's_conjecture wikiPageID "8175877".
- Vizing's_conjecture wikiPageRevisionID "486155521".
- Vizing's_conjecture authorlink "Vadim G. Vizing".
- Vizing's_conjecture first "Vadim G.".
- Vizing's_conjecture hasPhotoCollection Vizing's_conjecture.
- Vizing's_conjecture last "Vizing".
- Vizing's_conjecture title "Vizing Conjecture".
- Vizing's_conjecture urlname "VizingConjecture".
- Vizing's_conjecture year "1968".
- Vizing's_conjecture subject Category:Conjectures.
- Vizing's_conjecture subject Category:Graph_invariants.
- Vizing's_conjecture subject Category:Graph_products.
- Vizing's_conjecture type Abstraction100002137.
- Vizing's_conjecture type Cognition100023271.
- Vizing's_conjecture type Concept105835747.
- Vizing's_conjecture type Conjectures.
- Vizing's_conjecture type Content105809192.
- Vizing's_conjecture type Feature105849789.
- Vizing's_conjecture type GraphInvariants.
- Vizing's_conjecture type Hypothesis105888929.
- Vizing's_conjecture type Idea105833840.
- Vizing's_conjecture type Invariant105850432.
- Vizing's_conjecture type Property105849040.
- Vizing's_conjecture type PsychologicalFeature100023100.
- Vizing's_conjecture type Speculation105891783.
- Vizing's_conjecture 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 (1968), and states that, if γ(G) denotes the minimum number of vertices in a dominating set for G, thenγ(G ◻ H) ≥ γ(G)γ(H).Gravier & Khelladi (1995) conjectured a similar bound for the domination number of the tensor product of graphs; however, a counterexample was found by Klavžar & Zmazek (1996).".
- Vizing's_conjecture label "Vizing's conjecture".
- Vizing's_conjecture label "Гипотеза Визинга".
- Vizing's_conjecture sameAs m.026v9bp.
- Vizing's_conjecture sameAs Q7938022.
- Vizing's_conjecture sameAs Q7938022.
- Vizing's_conjecture sameAs Vizing's_conjecture.
- Vizing's_conjecture wasDerivedFrom Vizing's_conjecture?oldid=486155521.
- Vizing's_conjecture depiction Star_product_domination.svg.
- Vizing's_conjecture isPrimaryTopicOf Vizing's_conjecture.
