✦ LIBER ✦

On the sum of two parameters concerning independence and irredundance in a graph

✍ Scribed by Chengde Wang

Publisher: Elsevier Science
Year: 1988
Tongue: English
Weight: 398 KB
Volume: 69
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(88)90020-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Two relations between the parameters of

Two relations between the parameters of independence and irredundance

✍ O. Favaron 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 565 KB

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

On the independence ratio of a graph

✍ Michael O. Albertson; Joan P. Hutchinson 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 318 KB

## Abstract This paper presents some recent results on lower bounds for independence ratios of graphs of positive genus and shows that in a limiting sense these graphs have the same independence ratios as do planar graphs. This last result is obtained by an application of Menger's Theorem to show t

A Short Proof of a Theorem Concerning De

A Short Proof of a Theorem Concerning Degree Sums and Connectivity on Hamiltonian Graphs

✍ Bing Wei 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 74 KB

proved that if G is a 2-connected graph with n vertices such that d(u)+d(v)+d(w) n+} holds for any triple of independent vertices u, v, and w, then G is hamiltonian, where } is the vertex connectivity of G. In this note, we will give a short proof of the above result.

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

On the sum of all distances in a graph o

On the sum of all distances in a graph or digraph

✍ Ján Plesník 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 870 KB

The transmission of a graph or digraph G is the sum of all distances in G. StFict bounds on the transmission are collected and extended for several classes of graphs and digraphs. For example, in the class of 2connected or Z-edge-mnnected graphs of order n, the maximal transmission is realized only