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
相关论文
共 50 条