تقرير
On Separating Path and Tree Systems in Graphs
| العنوان: | On Separating Path and Tree Systems in Graphs |
|---|---|
| المؤلفون: | Biniaz, Ahmad, Bose, Prosenjit, De Carufel, Jean-Lou, Maheshwari, Anil, Miraftab, Babak, Odak, Saeed, Smid, Michiel, Smorodinsky, Shakhar, Yuditsky, Yelena |
| سنة النشر: | 2023 |
| المجموعة: | Computer Science Mathematics |
| مصطلحات موضوعية: | Computer Science - Discrete Mathematics, Mathematics - Combinatorics |
| الوصف: | We explore the concept of separating systems of vertex sets of graphs. A separating system of a set $X$ is a collection of subsets of $X$ such that for any pair of distinct elements in $X$, there exists a set in the separating system that contains exactly one of the two elements. A separating system of the vertex set of a graph $G$ is called a vertex-separating path (tree) system of $G$ if the elements of the separating system are paths (trees) in the graph $G$. In this paper, we focus on the size of the smallest vertex-separating path (tree) system for different types of graphs, including trees, grids, and maximal outerplanar graphs. Comment: 23 page, 3 figures |
| نوع الوثيقة: | Working Paper |
| URL الوصول: | http://arxiv.org/abs/2312.14295 |
| رقم الأكسشن: | edsarx.2312.14295 |
| قاعدة البيانات: | arXiv |
| الوصف غير متاح. |