Structure of the set of all minimal total dominating functions of some classes of graphs
K. Reji Kumar ; Gary MacGillivray
Discussiones Mathematicae Graph Theory, Tome 30 (2010), p. 407-423 / Harvested from The Polish Digital Mathematics Library
Access to full text
Full (PDF)

In this paper we study some of the structural properties of the set of all minimal total dominating functions (T) of cycles and paths and introduce the idea of function reducible graphs and function separable graphs. It is proved that a function reducible graph is a function separable graph. We shall also see how the idea of function reducibility is used to study the structure of T(G) for some classes of graphs.

Publié le : 2010-01-01
EUDML-ID : urn:eudml:doc:270796 
@article{bwmeta1.element.bwnjournal-article-doi-10_7151_dmgt_1503,
     author = {K. Reji Kumar and Gary MacGillivray},
     title = {Structure of the set of all minimal total dominating functions of some classes of graphs},
     journal = {Discussiones Mathematicae Graph Theory},
     volume = {30},
     year = {2010},
     pages = {407-423},
     zbl = {1217.05183},
     language = {en},
     url = {http://dml.mathdoc.fr/item/bwmeta1.element.bwnjournal-article-doi-10_7151_dmgt_1503}
}

K. Reji Kumar; Gary MacGillivray. Structure of the set of all minimal total dominating functions of some classes of graphs. Discussiones Mathematicae Graph Theory, Tome 30 (2010) pp. 407-423. http://gdmltest.u-ga.fr/item/bwmeta1.element.bwnjournal-article-doi-10_7151_dmgt_1503/

[000] [1] B. Grünbaum, Convex Polytopes (Interscience Publishers, 1967).

[001] [2] E.J. Cockayne and C.M. Mynhardt, A characterization of universal minimal total dominating functions in trees, Discrete Math. 141 (1995) 75-84, doi: 10.1016/0012-365X(93)E0192-7. | Zbl 0824.05034

[002] [3] E.J. Cockayne, C.M. Mynhardt and B. Yu, Universal minimal total dominating functions in graphs, Networks 24 (1994) 83-90, doi: 10.1002/net.3230240205. | Zbl 0804.90122

[003] [4] E.J. Cockayne, C.M. Mynhardt and B. Yu, Total dominating functions in trees: Minimality and convexity, J. Graph Theory 19 (1995) 83-92, doi: 10.1002/jgt.3190190109. | Zbl 0819.05035

[004] [5] T.W. Haynes, S.T. Hedetniemi and P.J. Slater, Fundamentals of Domination in Graphs (Marcel Dekker, Inc., New York, 1998). | Zbl 0890.05002

[005] [6] T.W. Haynes, S.T. Hedetniemi and P.J. Slater, Domination in Graphs - Advanced Topics (Marcel Dekker, Inc., New York, 1998). | Zbl 0883.00011

[006] [7] K. Reji Kumar, Studies in Graph Theory - Dominating functions, Ph.D Thesis (Manonmaniam Sundaranar University, Tirunelveli, India, 2004).

[007] [8] K. Reji Kumar, G. MacGillivray and R.B. Bapat, Topological properties of the set of all minimal total dominating functions of a graph, manuscript. | Zbl 1244.05167

[008] [9] D.B. West, Graph Theory : An introductory course (Prentice Hall, New York, 2002).