INDEPENDENCE SATURATION AND EXTENDED DOMINATION CHAIN IN GRAPHS

被引：0

作者：

Arumugam, S. ^{[1
]}

Subramanian, M. ^{[1
]}

机构：

[1] Kalasalingam Univ, Natl Ctr Adv Res Discrete Math n CARDMATH, CGRF, Krishnankoil 626190, India

来源：

AKCE INTERNATIONAL JOURNAL OF GRAPHS AND COMBINATORICS | 2007年 / 4卷 / 02期

关键词：

Irredundance; Independence; Domination; Independence saturation; Edge independence saturation;

D O I：

暂无

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

The six basic parameters relating to domination, independence and irredundance satisfy a chain of inequalities given by ir < gamma <= i <= beta(0) <= Gamma <= IR where ir, IR are the irredundance and upper irredundance numbers, gamma, Gamma are the domination and upper domination numbers and i, beta(0) are the independent domination number and independence number respectively. In this paper, we introduce the concept of independence saturation number IS of a graph which extends the above domination chain. We also consider the edge-analogue of this extended domination chain.

引用

页码：171 / 181

页数：11

共 10 条

[1]

Acharya B.D., 1980, J MATH PHYS SCI, V14, P471

[2]

Arumugam S, 2002, INDIAN J PURE AP MAT, V33, P1671

[3]

Cockayne E. J., 1978, CANAD MATH B, V21, P461

[4] THE SEQUENCE OF UPPER AND LOWER DOMINATION, INDEPENDENCE AND IRREDUNDANCE NUMBERS OF A GRAPH [J].

COCKAYNE, EJ ;

MYNHARDT, CM .

DISCRETE MATHEMATICS, 1993, 122 (1-3) :89-102

[5]

Harary F., 1972, GRAPH THEORY

[6]

Haynes T. W., 1998, FUNDAMENTALS DOMINAT, V28

[7]

Haynes T.W., 1998, FUNDAMENTALS DOMINAT

[8]

Lampert D.E., 1995, C NUMER, V109, P203

[9]

Slater P. J., 2004, COMMUNICATION

[10]

Subramanian M., 2004, THESIS

← 1 →