On the residue of a graph
Odile Favaron, Maryvonne Mahéo, Jean-François Saclé · Journal of Graph Theory · 1991
Abstract The residue R of a simple graph G of degree sequence S: d1 ⩾ d2 ⩾ …︁ ⩾ dn is the number of zeros obtained by the iterative process consisting of deleting the first term d1 of S, subtracting 1 from the d1 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 .