Full-text resources of PSJD and other databases are now available in the new Library of Science.
Visit https://bibliotekanauki.pl

PL EN


Preferences help
enabled [disable] Abstract
Number of results
2015 | 24 |

Article title

On the Path Sequence of a Graph

Content

Title variants

Languages of publication

PL

Abstracts

PL
A subset S of vertices of a graph G = (V,E) is called a k-path vertex cover if every path on k vertices in G contains at least one vertex from S. Denote by Ψk (G) the minimum cardinality of a k-path vertex cover in G and form a sequence Ψ (G) = (Ψ1 (G), Ψ2 (G), . . . , Ψ|V| (G)), called the path sequence of G. In this paper we prove necessary and sufficient conditions for two integers to appear on fixed positions in Ψ(G). A complete list of all possible path sequences (with multiplicities) for small connected graphs is also given.

Publisher

Year

Volume

24

Physical description

Dates

published
2015
online
06 - 07 - 2016

Contributors

References

Document Type

Publication order reference

Identifiers

YADDA identifier

bwmeta1.element.ojs-issn-2083-8476-year-2015-volume-24-article-6348
JavaScript is turned off in your web browser. Turn it on to take full advantage of this site, then refresh the page.