3 papers
math.CO2015
Identifying Codes in the Complementary Prism of Cycles
Marcia R. Cappelle, Erika M. M. Coelho, Hebert Coelho +2
We show that an identifying code of minimum order in the complementary prism of a cycle of order has order . Furthermore, we observe that the clique-width of the com…
math.CO2015
Graphs in which some and every maximum matching is uniquely restricted
Lucia Draque Penso, Dieter Rautenbach, Ueverton dos Santos Souza
A matching in a graph is uniquely restricted if there is no matching in that is distinct from but covers the same vertices as . Solving a problem posed by G…
cs.DC2003
A distributed algorithm to find k-dominating sets
L. D. Penso, V. C. Barbosa
We consider a connected undirected graph with nodes and edges. A -dominating set in is a set of nodes having the property that every node in is at m…