✦ LIBER ✦

Minimal regular graph containing a given graph

✍ Scribed by Aditya Shastri

Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 206 KB
Volume: 5
Category: Article
ISSN: 0893-9659
DOI: 10.1016/0893-9659(92)90124-r

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On graphs containing a given graph as ce

On graphs containing a given graph as center

✍ Fred Buckley; Zevi Miller; Peter J. Slater 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 367 KB 👁 1 views

## Abstract We examine the problem of embedding a graph __H__ as the center of a supergraph __G__, and we consider what properties one can restrict __G__ to have. Letting __A(H)__ denote the smallest difference ∣__V(G)__∣ ‐ ∣__V(H)__∣ over graphs __G__ having center isomorphic to __H__ it is demons

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

A characterization of 3-connected graphs

A characterization of 3-connected graphs containing a given graph

✍ Seiya Negami 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 329 KB

Every regular graph is a quasigroup grap

Every regular graph is a quasigroup graph

✍ W. Dörfler 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 344 KB

~~r~h-~~lland Publishing Company Receiwd 4 kbrurary 1974 \* ph-them-etic tei7ninolcllgy use in this nste, see [ 21; for alge-; a gxoupoid (i.e., a set with a binary mmposition) in whi rary two eleme the equations 42s = b and 332 =t I ueiy defined s d ~7. Since associative quasigroups are gmups, the

On smallest regular graphs with a given

On smallest regular graphs with a given isopart

✍ John Frederick Fink 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 408 KB 👁 1 views

## Abstract For a nonempty graph, G, we define p(G) and r(G) to be respectively the minimum order and minimum degree of regularity among all connected regular graphs __H__ having a nontrivial decomposition into subgraphs isomorphic to G. By f(G), we denote the least integer t for which there is a c

A note on minimal directed graphs with g

A note on minimal directed graphs with given girth

✍ Yahya Ould Hamidoune 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 306 KB