Search
Now showing items 1-10 of 16
Error-Correcting codes fromk-resolving sets
(UNIV ZIELONA GORA, 2019)
Global defensive k-alliances in directed graphs: combinatorial and computational issues
(EDP SCIENCES S A, 2020-05)
Further new results on strong resolving partitions for graphs
(DE GRUYTER, 2020-05)
(Open) packing number of some graph products
(DISCRETE MATHEMATICS THEORETICAL COMPUTER SCIENCE, 2020)
Independent transversal total domination versus total domination in trees
(UNIV ZIELONA GORA, 2021)
A constructive characterization of vertex cover Roman trees
(UNIV ZIELONA GORA, 2020)
Roman domination in direct product graphs and rooted product graphs1
(AMER INST MATHEMATICAL SCIENCES-AIMS, 2021)
Approach to the Formulation of the Variable Change Theorem
(MDPI, 2021-07)