Result 1 to 20 of 907 total
Connected dominating sets on dynamic geometric graphs. (English)
Comput. Geom. 46, No. 2, 160-172 (2013).
1
Totally connected domination in graphs. (English)
Adv. Stud. Contemp. Math., Kyungshang 22, No. 4, 557-563 (2012).
2
Domination number of circular-arc overlap graphs: a new perspective. (English)
Int. J. Math. Anal., Ruse 6, No. 45-48, 2299-2306 (2012).
3
Closed domination in graphs. (English)
Int. Math. Forum 7, No. 49-52, 2509-2518 (2012).
4
Dominating sets of some graphs associated to commutative rings. (English)
Commun. Algebra 40, No. 9, 3389-3396 (2012).
5
Bondage number of mesh networks. (English)
Front. Math. China 7, No. 5, 813-826 (2012).
6
Parameterized complexity in multiple-interval graphs: domination, partition, separation, irredundancy. (English)
Theor. Comput. Sci. 461, 27-44 (2012).
7
Monotonicity and expansion of global secure sets. (English)
Discrete Math. 312, No. 23, 3451-3456 (2012).
8
Complexity of distance paired-domination problem in graphs. (English)
Theor. Comput. Sci. 459, 89-99 (2012).
9
The limit case of a domination property. (English)
Acta Math. Sin., Engl. Ser. 28, No. 3, 463-468 (2012).
10
An investigation of new graph invariants related to the domination number of random proximity catch digraphs. (English)
Methodol. Comput. Appl. Probab. 14, No. 2, 299-334 (2012).
11
Solving the connected dominating set problem and power dominating set problem by integer programming. (English)
Lin, Guohui (ed.), Combinatorial optimization and applications. 6th international conference, COCOA 2012, Banff, AB, Canada, August 5‒9, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-31769-9/pbk). Lecture Notes in Computer Science 7402, 371-383 (2012).
12
Minsum hyperspheres in normed spaces. (English)
Discrete Appl. Math. 160, No. 15, 2221-2233 (2012).
13
Kernelization hardness of connectivity problems in $d$-degenerate graphs. (English)
Discrete Appl. Math. 160, No. 15, 2131-2141 (2012).
14
Domination value in $P_2\square p_n$ and $P_2\square c_n$. (English)
J. Comb. Math. Comb. Comput. 82, 59-75 (2012).
15
The total bondage number of grid graphs. (English)
Discrete Appl. Math. 160, No. 16-17, 2408-2418 (2012).
16
Finding minimum weight connected dominating set in stochastic graph based on learning automata. (English)
Inf. Sci. 200, 57-77 (2012).
17
A bound on the bondage number of toroidal graphs. (English)
Discrete Math. Algorithms Appl. 4, No. 3, 1250046,5p. (2012).
18
Hardness complexity of optimal substructure problems on power-law graphs. (English)
Thai, My T. (ed.) et al., Handbook of optimization in complex networks. Theory and applications. New York, NY: Springer (ISBN 978-1-4614-0753-9/hbk; 978-1-4614-0754-6/ebook). Springer Optimization and Its Applications 57, 255-277 (2012).
19
Mixed tree domination number. (English)
Adv. Appl. Discrete Math. 9, No. 1, 45-55 (2012).
20
Result 1 to 20 of 907 total
Start
Contact
Print
General Help
