✦ LIBER ✦

A computer-aided proof of a conjecture in Euclidean geometry

✍ Scribed by Mihai Cipu

Book ID: 108077292
Publisher: Elsevier Science
Year: 2008
Tongue: English
Weight: 334 KB
Volume: 56
Category: Article
ISSN: 0898-1221
DOI: 10.1016/j.camwa.2008.07.010

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Application of a computer to the proof o

Application of a computer to the proof of a conjecture of Minkowski in the geometry of numbers

✍ A. V. Malyshev 📂 Article 📅 1982 🏛 Springer US 🌐 English ⚖ 648 KB

Proof of a conjecture in domination theo

Proof of a conjecture in domination theory

✍ Igor E. Zverovich 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 76 KB

A dominating set D of a graph G is a least dominating set (I.d.s) if y((D)) < 2~((D~)) for any dominating set D1 (7 denotes domination number). The least domination number ~ ~ (G) of G is the minimum cardinality of a 1.d.s. We prove a conjecture of Sampathkumar (1990) that Vl ~< 3p/5 for any connect

A proof of a conjecture of minus dominat

A proof of a conjecture of minus domination in graphs

✍ Chunxiang Wang; Jingzhong Mao 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 60 KB

A computational attack on the conjecture

A computational attack on the conjectures of Graffiti: New counterexamples and proofs

✍ Tony L. Brewster; Michael J. Dinneen; Vance Faber 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 788 KB

Graffiti is a computer program that checks for relationships among certain graph invariants. It uses a database of graphs and has generated well over 700 conjectures. Having obtained a readily available computer tape of all the nonisomorphic graphs with 10 or fewer vertices, we have tested approxima

Proof of a conjecture on cycles in a bip

Proof of a conjecture on cycles in a bipartite graph

✍ Wang, Hong 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 244 KB 👁 2 views

It was conjectured in [Wang, to appear in The Australasian Journal of Combinatorics] that, for each integer k ≥ 2, there exists . This conjecture is also verified for k = 2, 3 in [Wang, to appear; Wang, manuscript]. In this article, we prove this conjecture to be true if n ≥ 3k, i.e., M (k) ≤ 3k. W

Proof of a conjecture on -tuple dominati

Proof of a conjecture on -tuple domination in graphs

✍ Guangjun Xu; Liying Kang; Erfang Shan; Hong Yan 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 142 KB

Let G = (V, E) be a graph and N G [v] the closed neighborhood of a vertex v in G. For k ∈ N, the minimum cardinality of a set In this note we prove the following conjecture of Rautenbach and Volkmann [D. Rautenbach, L. Volkmann, New bounds on the k-domination number and the k-tuple domination numbe