𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the residue of a graph

✍ Scribed by O. Favaron; M. Mahéo; J.-F. Saclé

Publisher
John Wiley and Sons
Year
1991
Tongue
English
Weight
915 KB
Volume
15
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

The residue R of a simple graph G of degree sequence S: d~1~ ⩾ d~2~ ⩾ …︁ ⩾ d~n~ is the number of zeros obtained by the iterative process consisting of deleting the first term d~1~ of S, subtracting 1 from the d~1~ following ones, and sorting down the new sequence. The depth is the number n ‐ R of steps in this algorithm. We prove here some conjectures given by the computer program GRAFFITI, in particular, magnified image.

📜 SIMILAR VOLUMES

k-Independence and thek-residue of a gra
k-Independence and thek-residue of a graph
✍ Jelen, Frank 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 282 KB 👁 2 views

Favaron, Mahéo, and Saclé proved that the residue of a simple graph G is a lower bound on its independence number α(G). For k ∈ N, a vertex set X in a graph is called k-independent, if the subgraph induced by X has maximum degree less than k. We prove that a generalization of the residue, the k-resi

Graphs of cumulative residuals
Graphs of cumulative residuals
✍ E. B. Kraus 📂 Article 📅 1956 🏛 John Wiley and Sons 🌐 English ⚖ 180 KB

## Abstract The particular uses of cumulative residuals are demonstrated by two plots of annual Nile discharge at Aswan. It is shown that the mean regime of the Nile changed abruptly in 1898 in conformance with secular rainfall changes throughout most of the tropics. No trend is apparent in the two

On the hamiltonian path graph of a graph
On the hamiltonian path graph of a graph
✍ George R. T. Hendry 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 491 KB 👁 1 views

The hamiltonian path graph H(F) of a graph F is that graph having the same vertex set as F and in which two vertices u and u are adjacent if and only if F contains a hamiltonian u -u path. First, in response to a conjecture of Chartrand, Kapoor and Nordhaus, a characterization of nonhamiltonian grap

On the eulericity of a graph
On the eulericity of a graph
✍ K. R. Matthews 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 200 KB

## Abstract The eulericity ϵ(__G__) of a bridgeless graph __G__ is defined as the least number of eulerian subgraphs of __G__ which together cover the lines of __G__. A 1–1 correspondence is shown to exist between the __k__‐tuples of eulerian subgraphs of __G__ and the proper flows (mod2^__k__^) on

On the chordality of a graph
On the chordality of a graph
✍ Terry A. McKee; Edward R. Scheinerman 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 574 KB

## Abstract The __chordality__ of a graph __G__ = (__V, E__) is defined as the minimum __k__ such that we can write __E__ = __E__~1~ ∩ … ∩ __E__~__k__~ with each (__V, E__~__i__~) a chordal graph. We present several results bounding the value of this generalization of boxicity. Our principal result