首页   按字顺浏览 期刊浏览 卷期浏览 Sequences of graphical invariants
Sequences of graphical invariants

 

作者: Jerzy Topp,  

 

期刊: Networks  （WILEY Available online 1995）
卷期: Volume 25, issue 1  

页码: 1-5

 

ISSN:0028-3045

 

年代: 1995

 

DOI:10.1002/net.3230250102

 

出版商: Wiley Subscription Services, Inc., A Wiley Company

 

数据来源: WILEY

 

摘要:

AbstractFor a given graphical invariant π, a sequence (ao, a1,…, an) of positive integers is said to be π‐feasible if there exists a graphGwith distinguished vertices ν1, ν2,…, νnsuch that π(G)= aoand π(G −ν1−ν2−…−νi) = aifor i = 1, 2,…,n. In this paper, we investigate π‐feasible sequences for the irredundance, domination, and i

 

点击下载:  PDF (466KB)



返 回