| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4949961 | Discrete Applied Mathematics | 2016 | 8 Pages |
Abstract
A path separator of a graph G is a set of paths P={P1,â¦,Pt} such that for every pair of edges e,fâE(G), there exist paths Pe,PfâP such that eâE(Pe), fâE(Pe), eâE(Pf) and fâE(Pf). The path separation number of G, denoted psn(G), is the smallest number of paths in a path separator. We shall estimate the path separation number of several graph families-including complete graphs, random graph, the hypercube-and discuss general graphs as well.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
József Balogh, Béla Csaba, Ryan R. Martin, András Pluhár,