# Search results for: Dorota Kuziak

Discrete Applied Mathematics > 2018 > 236 > C > 270-287

Discussiones Mathematicae Graph Theory > 2017 > 38 > 1 > 287-299

Applied Mathematics and Computation > 2017 > 314 > C > 429-438

_{G}(w, x) ≠ d

_{G}(w, y). A set S of vertices in a connected graph G is a mixed metric generator for G if every two distinct elements (vertices or edges) of G are distinguished by some vertex of S. The smallest cardinality of a mixed metric generator for G is called the mixed metric dimension...

Discussiones Mathematicae Graph Theory > 2017 > 37 > 1 > 273-293

Theoretical Computer Science > 2016 > 653 > C > 1-14

Discussiones Mathematicae Graph Theory > 2016 > 36 > 4 > 1051-1064

Results in Mathematics > 2017 > 71 > 1-2 > 509-526

*G*, a vertex $${w \in V(G)}$$ w ∈ V ( G ) distinguishes two different vertices

*u*,

*v*of

*G*if the distances between

*w*and

*u*, and between

*w*and

*v*are different. Moreover,

*w*strongly resolves the pair

*u*,

*v*if there exists some shortest

*u*−

*w*path containing

*v*or some shortest

*v*−

*w*path containing

*u*. A set

*W*of vertices is a (strong) metric generator for

*G*if every pair of...

Bulletin of the Malaysian Mathematical Sciences Society > 2016 > 39 > 1 > 199-217

*S*of vertices of a graph

*G*is a dominating set in

*G*if every vertex outside of

*S*is adjacent to at least one vertex belonging to

*S*. A domination parameter of

*G*is related to those sets of vertices of a graph satisfying some domination property together with other conditions on the vertices of

*G*. Here, we investigate several domination-related parameters in rooted product graphs.

Open Mathematics > 2015 > 13 > 1

Open Mathematics > 2015 > 13 > 1

Discrete Mathematics > 2014 > 335 > Complete > 8-19

Discrete Mathematics > 2014 > 331 > Complete > 43-52

Electronic Notes in Discrete Mathematics > 2014 > 46 > Complete > 169-176

Discrete Applied Mathematics > 2013 > 161 > 7-8 > 1022-1027

Aequationes mathematicae > 2013 > 86 > 1-2 > 1-21

*G*is an assignment of colors to the vertices of

*G*so that every two adjacent vertices of

*G*have different colors. A coloring related property of a graphs is also an assignment of colors or labels to the vertices of a graph, in which the process of labeling is done according to an extra condition. A set

*S*of vertices of a graph

*G*is a dominating set in

*G*if every vertex...