✦ LIBER ✦

Total Domination in Graphs with Given Girth

✍ Scribed by Michael A. Henning; Anders Yeo

Publisher: Springer Japan
Year: 2008
Tongue: English
Weight: 240 KB
Volume: 24
Category: Article
ISSN: 0911-0119
DOI: 10.1007/s00373-008-0797-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Girth and Total Domination in Graphs

✍ Michael A. Henning; Anders Yeo 📂 Article 📅 2011 🏛 Springer Japan 🌐 English ⚖ 290 KB

Regular graphs with given girth pair

✍ Frank Harary; Peter Kovács 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 453 KB 👁 1 views

## Abstract The girth pair of a graph gives the length of a shortest odd and a shortest even cycle. The existence of regular graphs with given degree and girth pair is proved and simple bounds for their smallest order are developed. Several infinite classes of such graphs are constructed and it is

Domination number of cubic graphs with l

Domination number of cubic graphs with large girth

✍ Daniel Král'; Petr Škoda; Jan Volec 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 219 KB

We show that every n-vertex cubic graph with girth at least g have domination number at most 0.299871n+O(n / g) < 3n / 10+O(n / g) This research was done when the Petr Škoda was a student of

Total domination in graphs

✍ E. J. Cockayne; R. M. Dawes; S. T. Hedetniemi 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 374 KB

Graphs and digraphs with given girth and

Graphs and digraphs with given girth and connectivity

✍ Jiping Liu; ; Huishan Zhou 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 230 KB

In this paper, we show that for any given two positive integers g and k with g > 3, there exists a graph (digraph) G with girth g and connectivity k. Applying this result, we give a negative answer to the problem proposed by M. Junger, G. Reinelt and W.R Pulleyblank (1985).

Graphs with large total domination numbe

Graphs with large total domination number

✍ Michael A. Henning 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 246 KB 👁 1 views