𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A survey of automated conjectures in spectral graph theory

✍ Scribed by M. Aouchiche; P. Hansen

Publisher
Elsevier Science
Year
2010
Tongue
English
Weight
910 KB
Volume
432
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A survey: Recent results, conjectures, a
A survey: Recent results, conjectures, and open problems in labeling graphs
✍ Joseph A. Gallian πŸ“‚ Article πŸ“… 1989 πŸ› John Wiley and Sons 🌐 English βš– 752 KB

In this paper we organize and summarize much of the work done on graceful and harmonious labelings of graphs. Many open problems and conjectures are included.

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

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

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