✦ LIBER ✦

Graphs with small numbers of independent edges

✍ Scribed by Miroslav M. Petrović; Ivan Gutman; Mirko Lepović

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 327 KB
Volume: 126
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(94)90268-2

No coin nor oath required. For personal study only.

✦ Synopsis

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

📜 SIMILAR VOLUMES

The independence number of an edge-chrom

The independence number of an edge-chromatic critical graph

✍ Douglas R. Woodall 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 77 KB 👁 1 views

A graph G with maximum degree and edge chromatic number (G)> is edge--critical if (G -e) = for every edge e of G. It is proved here that the vertex independence number of an edge--critical graph of order n is less than 3 5 n. For large , this improves on the best bound previously known, which was ro

Numbers of edges in supermagic graphs

✍ Svetlana Drajnová; Jaroslav Ivančo; Andrea Semaničová 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 109 KB

## Abstract A graph is called supermagic if it admits a labelling of the edges by pairwise different consecutive integers such that the sum of the labels of the edges incident with a vertex is independent of the particular vertex. In the paper we establish some bounds for the number of edges in sup

On the maximum number of independent edg

On the maximum number of independent edges in cubic graphs

✍ Arthur M. Hobbs; Edward Schmeichel 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 146 KB

Let the reals be extended to include oo with o~ > r

The maximum number of Kj-subgraphs in a

The maximum number of Kj-subgraphs in a graph with k independent edges

✍ Robert James Douglas 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 173 KB

On graphs with small Ramsey numbers

✍ A. V. Kostochka; V. Rödl 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 88 KB

## Abstract Let __R__(__G__) denote the minimum integer __N__ such that for every bicoloring of the edges of __K~N~__, at least one of the monochromatic subgraphs contains __G__ as a subgraph. We show that for every positive integer __d__ and each γ,0 < γ < 1, there exists __k__ = __k__(__d__,γ) su

Fragile graphs with small independent cu

Fragile graphs with small independent cuts

✍ Guantao Chen; Ralph J. Faudree; Michael S. Jacobson 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 142 KB

## Abstract A graph is called __fragile__ if it has a vertex cut which is also an independent set. Chen and Yu proved that every graph with __n__ vertices and at most 2__n__−4 edges is fragile, which was conjectured to be true by Caro. However, their proof does not give any information on the numbe