首页   按字顺浏览 期刊浏览 卷期浏览 On (I*.n)-regular graphs
On (I*.n)-regular graphs

 

作者: H.A. Henning,   HendaC. Swart,   P.A. Winter,  

 

期刊: Quaestiones Mathematicae  （Taylor Available online 1988）
卷期: Volume 11, issue 1  

页码: 51-63

 

ISSN:1607-3606

 

年代: 1988

 

DOI:10.1080/16073606.1988.9631942

 

出版商: Taylor & Francis Group

 

关键词: 05675

 

数据来源: Taylor

 

摘要:

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.

 

点击下载:  PDF (307KB)



返 回