๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Some remarks on the signed domatic number of graphs with small minimum degree

โœ Scribed by Lutz Volkmann

Publisher
Elsevier Science
Year
2009
Tongue
English
Weight
379 KB
Volume
22
Category
Article
ISSN
0893-9659

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On the domination number of Hamiltonian
On the domination number of Hamiltonian graphs with minimum degree six
โœ Hua-Ming Xing; Johannes H. Hattingh; Andrew R. Plummer ๐Ÿ“‚ Article ๐Ÿ“… 2008 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 177 KB

The domination number of G, denoted by ฮณ (G), is the minimum cardinality of a dominating set of G. We prove that if G is a Hamiltonian graph of order n with minimum degree at least six, then ฮณ (G) โ‰ค 6n 17 .

On the independent domination number of
On the independent domination number of graphs with given minimum degree
โœ N.I. Glebov; A.V. Kostochka ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 175 KB

We prove a new upper bound on the independent domination number of graphs in terms of the number of vertices and the minimum degree. This bound is slightly better than that of Haviland (1991) and settles the case 6 = 2 of the corresponding conjecture by Favaron (1988). @ 1998 Elsevier Science B.V. A

The number of cutvertices in graphs with
The number of cutvertices in graphs with given minimum degree
โœ L.H. Clark; R.C. Entringer ๐Ÿ“‚ Article ๐Ÿ“… 1990 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 453 KB

The maximum number of cutvertices in a connected graph of order n having minimum degree at least 6 is determined for 6 > 5.

On the fixed edge of planar graphs with
On the fixed edge of planar graphs with minimum degree five
โœ Baogang Xu; Hongbing Fan ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 207 KB

An edge e of a finite and simple graph G is called a fixed edge of G if G -e + e' ~G implies e' = e. In this paper, we show that planar graphs with minimum degree 5 contain fixed edges, from which we prove that a class of planar graphs with minimum degree one is edge reconstructible.