✦ LIBER ✦

Highly irregular graphs with extreme numbers of edges

✍ Scribed by Zofia Majcher; Jerzy Michael

Publisher: Elsevier Science
Year: 1997
Tongue: English
Weight: 219 KB
Volume: 164
Category: Article
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(96)00056-8

No coin nor oath required. For personal study only.

✦ Synopsis

A simple connected graph is highly irregular if each of its vertices is adjacent only to vertices with distinct degrees. In this paper we find: (1) the greatest number of edges of a highly irregular graph with n vertices, where n is an odd integer (for n even this number is given in [1]), (2) the smallest number of edges of a highly irregular graph of given order.

📜 SIMILAR VOLUMES

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.

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 extremal number of edges in hamil

On the extremal number of edges in hamiltonian connected graphs

✍ Tung-Yang Ho; Cheng-Kuan Lin; Jimmy J.M. Tan; D. Frank Hsu; Lih-Hsing Hsu 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 421 KB

a b s t r a c t Assume that n and δ are positive integers with 3 ≤ δ < n. Let hc(n, δ) be the minimum number of edges required to guarantee an n-vertex graph G with minimum degree δ(G) ≥ δ to be hamiltonian connected.

Polyhedral Graphs with Extreme Numbers o

Polyhedral Graphs with Extreme Numbers of Types of Faces

✍ Hansjoachim Walther 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 63 KB

Extremal graphs with prescribed covering

Extremal graphs with prescribed covering number

✍ J.A Bondy 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 120 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