Zobrazeno 1 - 10
of 35
pro vyhledávání: '"Gabriel Semanišin"'
Autor:
Iztok Peterin, Gabriel Semanišin
Publikováno v:
Mathematics, Vol 9, Iss 14, p 1592 (2021)
A shortest path P of a graph G is maximal if P is not contained as a subpath in any other shortest path. A set S⊆V(G) is a maximal shortest paths cover if every maximal shortest path of G contains a vertex of S. The minimum cardinality of a maximal
Externí odkaz:
https://doaj.org/article/33646f681ee14968a922b1f7ba774cde
Publikováno v:
Proceedings of the 15th International Conference on Agents and Artificial Intelligence.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7ee38d73cdbf308387567399e1347ab2
https://doi.org/10.5220/0011619000003393
https://doi.org/10.5220/0011619000003393
Autor:
Iztok Peterin, Gabriel Semanišin
Publikováno v:
Computational and Applied Mathematics. 41
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c7c900acd2b7581e127a7ac70a261ba4
https://doi.org/10.1007/s40314-022-01834-1
https://doi.org/10.1007/s40314-022-01834-1
Publikováno v:
Applied Mathematics and Computation. 352:211-219
Vertex cover number, which is one of the most basic graph invariants, can be viewed as the smallest number of vertices that hit (or that belong to) every subgraph K2 in a graph G. In this paper, we consider the next two smallest cases of connected gr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3346daa2d06a0f998ea2d5ab609a9a91
https://doi.org/10.1016/j.amc.2019.01.074
https://doi.org/10.1016/j.amc.2019.01.074
Publikováno v:
VISIGRAPP (5: VISAPP)
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8be3bce11b419065f55c7c46e019248e
https://doi.org/10.5220/0010177700150024
https://doi.org/10.5220/0010177700150024
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 36, Iss 3, Pp 661-668 (2016)
We consider (ψk−γk−1)-perfect graphs, i.e., graphs G for which ψk(H) = γk−1(H) for any induced subgraph H of G, where ψk and γk−1 are the k-path vertex cover number and the distance (k − 1)-domination number, respectively. We study (
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3a38370b8043d917b2c7a530ecabe2bb
https://doaj.org/article/947f16d6c02d44ada2548deb3d324374
https://doaj.org/article/947f16d6c02d44ada2548deb3d324374
Publikováno v:
Algorithmica. 78:896-913
The problem of finding an optimal semi-matching is a generalization of the problem of finding classical matching in bipartite graphs. A semi-matching in a bipartite graph G = (U, V, E) with n vertices and m edges is a set of edges M ⊆ E, such that
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::188b3fb1dc2a0b3eea1ceb6982bd2900
https://doi.org/10.1007/s00453-016-0182-3
https://doi.org/10.1007/s00453-016-0182-3
Publikováno v:
Discrete Applied Mathematics. 177:14-18
A subset S of vertices of a graph G is called a k -path vertex cover if every path of order k in G contains at least one vertex from S . The cardinality of a minimum k -path vertex cover is called the k -path vertex cover number of a graph G , denote
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::787b7f0a1252b4b840d3d9197b15a40e
https://doi.org/10.1016/j.dam.2014.05.042
https://doi.org/10.1016/j.dam.2014.05.042
Publikováno v:
Discrete Applied Mathematics. 161:1943-1949
A subset S of vertices of a graph G is called a vertex k-path cover if every path of order k in G contains at least one vertex from S. Denote by @j"k(G) the minimum cardinality of a vertex k-path cover in G. In this paper, an upper bound for @j"3 in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::56b2faa061a09a206e316452fdb6c189
https://doi.org/10.1016/j.dam.2013.02.024
https://doi.org/10.1016/j.dam.2013.02.024
Autor:
Gabriel Semanišin, Ján Katrenič
Publikováno v:
Discrete Applied Mathematics. 158:1624-1632
An edge-ordering of a graph G=(V,E) is a one-to-one function f from E to a subset of the set of positive integers. A path P in G is called an f-ascent if f increases along the edge sequence of P. The height h(f) of f is the maximum length of an f-asc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::600ff01552acb09297ecb34238cbfcff
https://doi.org/10.1016/j.dam.2010.05.018
https://doi.org/10.1016/j.dam.2010.05.018