✦ LIBER ✦

Edge-deletable IM-extendable graphs with minimum number of edges

✍ Scribed by Xiumei Wang; Jinjiang Yuan; Sujing Zhou

Book ID: 108114140
Publisher: Elsevier Science
Year: 2009
Tongue: English
Weight: 500 KB
Volume: 309
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2009.03.048

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Graphs of diameter 3 with the minimum nu

Graphs of diameter 3 with the minimum number of edges

✍ Zoltán Füredi 📂 Article 📅 1990 🏛 Springer Japan 🌐 English ⚖ 231 KB

Primitive graphs with given exponents an

Primitive graphs with given exponents and minimum number of edges

✍ Byeong Moon Kim; Byung Chul Song; Woonjae Hwang 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 364 KB

The minimum number of edges in graphs wi

The minimum number of edges in graphs with prescribed paths

✍ Nicholas Pippenger 📂 Article 📅 1978 🏛 Springer 🌐 English ⚖ 919 KB

Hamiltonian graphs with minimum number o

Hamiltonian graphs with minimum number of edges for fault-tolerant topologies

✍ Krishnendu Mukhopadhyaya; Bhabani P. Sinha 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 392 KB

Saturated graphs with minimal number of

Saturated graphs with minimal number of edges

✍ L. Kászonyi; Zs. Tuza 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 286 KB

Let F = {F,, . . .} be a given class of forbidden graphs. A graph G is called F-saturated if no F, E F is a subgraph of G but the addition of an arbitrary new edge gives a forbidden subgraph. In this paper the minimal number of edges in F-saturated graphs is examined. General estimations are given a

Graphs with small numbers of independent

Graphs with small numbers of independent edges

✍ Miroslav M. Petrović; Ivan Gutman; Mirko Lepović 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 327 KB

The graphs with exactly one, two or three independent edges are determined.