Irredundance Saturation Number Of A Graph

AUSTRALASIAN JOURNAL OF COMBINATORICS（2010）

引用 23|浏览3

暂无评分

摘要

Let G = (V, E) be a graph and let upsilon is an element of V. Let IRS(upsilon, G) denote the maximum cardinality of an irredundant set in G which contains upsilon. Then IRS(G) = min {IRS(upsilon, G) : upsilon is an element of V} is called the irredundance saturation number of G. In this paper we initiate a study of this parameter.

查看译文

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要