Result 1 to 10 of 10 total
Excellent trees and secure domination. (English)
Util. Math. 67, 255-267 (2005).
1
Augmenting trees to have two disjoint total dominating sets. (English)
Bull. Inst. Comb. Appl. 42, 12-18 (2004).
2
Upper line-distinguishing and upper harmonious chromatic numbers of cycles. (English)
J. Comb. Math. Comb. Comput. 45, 137-144 (2003).
3
Graphs with small upper line-distinguishing and upper harmonious chromatic numbers. (English)
J. Comb. Math. Comb. Comput. 47, 165-181 (2003).
4
On parameters related to strong and weak domination in graphs. (English)
Discrete Math. 258, No.1-3, 1-11 (2002).
5
The signed and minus $k$-subdomination numbers of certain complete multipartite graphs and their complements. (English)
Util. Math. 59, 77-95 (2001).
6
Partial signed domination in graphs. (English)
Ars Comb. 48, 33-42 (1998).
7
Minus $k$-subdomination in graphs. III. (English)
Australas. J. Comb. 17, 69-76 (1998).
8
The signed and minus $k$-subdomination numbers of comets. (English)
Discrete Math. 183, No.1-3, 141-152 (1998).
9
Minus $k$-subdomination in graphs. II. (English)
Discrete Math. 171, No.1-3, 141-151 (1997).
10
Result 1 to 10 of 10 total
Start
Contact
Print
General Help
