✦ LIBER ✦

Some remarks on E-minimal graphs

✍ Scribed by H.P. Yap

Publisher: Elsevier Science
Year: 1977
Tongue: English
Weight: 604 KB
Volume: 18
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(77)90010-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Some remarks on minimal surfaces in riem

Some remarks on minimal surfaces in riemannian manifolds

✍ Erhard Heinz; Stefan Hildebrandt 📂 Article 📅 1970 🏛 John Wiley and Sons 🌐 English ⚖ 277 KB

Some remarks on domination in cubic grap

Some remarks on domination in cubic graphs

✍ Bohdan Zelinka 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 445 KB

We study three recently introduced numerical invariants of graphs, namely, the signed domination number y., the minus domination number 7 and the majority domination number ymaj. An upper bound for ys and lower bounds for ;'-and Y,,~ are found, in terms of the order of the graph.

On some minimal graphs of the torus

✍ R. Bodendiek; K. Wagner 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 259 KB 👁 1 views

## Let be the set of finite, simple and nondirected graphs being not embeddable into the torus. Furthermore let >4 be a partial order-relation and M, (r) the minimal basis of I'. In this paper we determine three graphs of M, (r) being embeddable into the projective plane and containing the subgrap

Remarks on minimal surfaces

✍ Robert Osserman 📂 Article 📅 1959 🏛 John Wiley and Sons 🌐 English ⚖ 400 KB

Some remarks on minimal bases and maxima

Some remarks on minimal bases and maximal nonbases of integers

✍ Xing-De Jia 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 334 KB

In this note, we generalize the concepts of minimal bases and maximal nonbases for integers, and prove some existence theorems for the generalized minimal bases and maximal nonbases, which generalize some results of Stiihr, Deza and Erdds, and Nathanson.

Some remarks about factors of graphs

✍ José R. Correa; Martín Matamala 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 148 KB

## Abstract A (__g__, __f__)‐factor of a graph is a subset __F__ of __E__ such that for all $v \in V$, $g(v)\le {\rm deg}\_{F}(v)\le f(v)$. Lovasz gave a necessary and sufficient condition for the existence of a (__g__, __f__)‐factor. We extend, to the case of edge‐weighted graphs, a result of Kano