Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Włodzimierz Ulatowski"'
Autor:
Włodzimierz Ulatowski
Publikováno v:
Opuscula Mathematica, Vol 35, Iss 1, Pp 127-135 (2015)
In this paper we continue the study of paired-domination in graphs. A paired-dominating set, abbreviated PDS, of a graph \(G\) with no isolated vertex is a dominating set of vertices whose induced subgraph has a perfect matching. The paired-dominatio
Externí odkaz:
https://doaj.org/article/0f2b918e6c9642e5a6440d2e01209e74
Autor:
Włodzimierz Ulatowski
Publikováno v:
Opuscula Mathematica, Vol 33, Iss 4, Pp 763-783 (2013)
Let \(G=(V,E)\) be a graph with no isolated vertices. A set \(S\subseteq V\) is a paired-dominating set of \(G\) if every vertex not in \(S\) is adjacent with some vertex in \(S\) and the subgraph induced by \(S\) contains a perfect matching. The pai
Externí odkaz:
https://doaj.org/article/9f438f524abf4402aec304d5ce2c7896
Autor:
Włodzimierz Ulatowski
Publikováno v:
Discrete Mathematics. 143(1-3):251-257
The length of a set of cycles of a graph G is the sum of the lengths of its cycles. Consider a family A n of n -element sets of cycles of G . Let c − ( A g ) and c + ( A n ) be the minimum and maximum lengths among all sets of A n respectively. We
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1298c9c1ab0cdbea8ddc9a6b8ef8919c
Autor:
Włodzimierz Ulatowski
Publikováno v:
Discussiones Mathematicae Graph Theory. 29:615
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::70c02b7914ab9cac5ec2d8c68771a3e3
https://doi.org/10.7151/dmgt.1468
https://doi.org/10.7151/dmgt.1468
Autor:
Włodzimierz Ulatowski, Jerzy Topp
Publikováno v:
Applicationes Mathematicae. 19:611-617
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::eae72f1f2952c7afef4a6ace62ba4cbd
https://doi.org/10.4064/am-19-3-4-611-617
https://doi.org/10.4064/am-19-3-4-611-617