✦ LIBER ✦

The product of the independent domination numbers of a graph and its complement

✍ Scribed by E.J. Cockayne; O. Favaron; H. Li; G. MacGillivray

Publisher: Elsevier Science
Year: 1991
Tongue: English
Weight: 240 KB
Volume: 90
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(91)90151-q

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On domination and independent domination

On domination and independent domination numbers of a graph

✍ Robert B. Allan; Renu Laskar 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 399 KB

For a graph G, the definitions of doknation number, denoted y(G), and independent domination number, denoted i(G), are given, and the following results are obtained: oorollrrg 1. For any graph G, y(L(G)) = i@(G)), where Z,(G) is the line graph of G. (This $xh!s t.lic rtsult ~(L(T))~i(L(T)), h w ere

On the product of upper irredundance num

On the product of upper irredundance numbers of a graph and its complement

✍ E.J. Cockayne; C.M. Mynhardt 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 471 KB

The least point covering and domination

The least point covering and domination numbers of a graph

✍ E. Sampathkumar 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 310 KB

The minimum number of subgraphs in a gra

The minimum number of subgraphs in a graph and its complement

✍ Lane Clark 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 265 KB 👁 2 views

## Abstract For a graphb __F__ without isolated vertices, let __M__(__F__; __n__) denote the minimum number of monochromatic copies of __F__ in any 2‐coloring of the edges of __K__~__n__~. Burr and Rosta conjectured that when __F__ has order __t__, size __u__, and __a__ automorphisms. Independent

On the domination number of cross produc

On the domination number of cross products of graphs

✍ Sylvain Gravier; Abdelkader Khelladi 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 195 KB

In this communication the domination number of the cross product of an elementary path with the complement of another path is exactly determined and some inequalities for general cases are deduced. The paper ends with a Vizing-like conjecture relating the domination number of the cross product of G

The sequence of upper and lower dominati

The sequence of upper and lower domination, independence and irredundance numbers of a graph

✍ E.J. Cockayne; C.M. Mynhardt 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 803 KB

Necessary and sufficient conditions are established for the existence of a graph whose upper and lower domination, independence and irredundance numbers are six given positive integers. This result shows that the only relationships between these six parameters which hold for all graphs and which do