Original Articles

On (I*.n)-regular graphs

Published in: Quaestiones Mathematicae
Volume 11 , issue 1 , 1988 , pages: 51–63

DOI: 10.1080/16073606.1988.9631942

Author(s): H.A. Henning Department of Mathematics and Applied Mathematics, South Africa , HendaC. Swart Department of Mathematics and Applied Mathematics, South Africa , P.A. Winter Department of Mathematics and Applied Mathematics, South Africa

Keywords: 05675

Download full text Get new issue alerts

Abstract

A walk P in G is said to be a route if the length of P is at least one and no edge of G appears as two consecutive edge-terms of P. For n ≥ 2, a graph G is said to be (I*,n)-regular of degree k if each vertex of G is an end vertex of exactly k routes of length at most n-1. A complete characterization of (I*.n)-regular graphs is obtained.

« HILBERT SPACES ASSOCIATED WITH SECOND ORDER ELLIPTIC OPERATORS AND APPLICATIONS TO BOUNDARY VALUE PROBLEMS AND VARIATIONAL INEQUALITIES

GENERALIZED BALANCED IDEALS »