Total Domination Polynomial of A Graph

被引：0

作者：

Chaluvaraju, B. ^{[1
]}

Chaitra, V. ^{[1
]}

机构：

[1] Bangalore Univ, Dept Math, Cent Coll Campus, Bangalore 560001, Karnataka, India

来源：

JOURNAL OF INFORMATICS AND MATHEMATICAL SCIENCES | 2014年 / 6卷 / 02期

关键词：

Graph; Domination number; Sign domination number;

D O I：

暂无

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

A total domination polynomial of a graph G of order n is the polynomial D-td(G, x) = (sic) d(td)(G, t)x(t), where d(td)(G, t) is the number of total dominating sets of G of cardinality t. In this paper, we present various properties of total domination polynomial of graph G. Also determine the total domination polynomial of some graph operations.

引用

页码：87 / 92

页数：6

共 10 条

[1]

Alikhani S., 2013, ISBN COMBIN, V2013

[2]

Alikhani S, 2014, ARS COMBINATORIA, V114, P257

[3]

Arocha J. L., 2000, DISCUSS MATH GRAPH T, V20, P57, DOI DOI 10.7151/DMGT.1106

[4] TOTAL DOMINATION IN GRAPHS [J].

COCKAYNE, EJ ;

DAWES, RM ;

HEDETNIEMI, ST .

NETWORKS, 1980, 10 (03) :211-219

[5]

Gutman I., 2011, ZB RAD, V14, P137

[6]

Harary F., 1969, GRAPH THEORY, DOI DOI 10.21236/AD0705364

[7]

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

[8] A survey of selected recent results on total domination in graphs [J].

Henning, Michael A. .

DISCRETE MATHEMATICS, 2009, 309 (01) :32-63

[9]

Soner N. D., 2004, J MATH ED, V38, P77

[10]

Soner N. D., 2002, FAR E J APPL MATH, V6, P89

← 1 →