Path point cover
S. Soma Sundaram, A. Nagarajan, M. Anantha Krishnan
Abstract
S. Soma Sundaram, A. Nagarajan, M. Anantha Krishnan
Abstract
A path cover ψ is a collection of edge disjoint paths covering all the edges of G exactly once. A point v is said to cover a path P of ψ if v∈P. A ψ-point cover is defined as a collection of points S⊆V covering all the paths of ψ. In this paper we study some properties of ψ-point cover. This study is motivated by the work of Purnima Gupta and B.D. Acharya [3] on domination in graphoidal covers.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
A path cover ψ is a collection of edge disjoint paths covering all the edges of G exactly once. A point v is said to cover a path P of ψ if v∈P. A ψ-point cover is defined as a collection of points S⊆V covering all the paths of ψ. In this paper we study some properties of ψ-point cover. This study is motivated by the work of Purnima Gupta and B.D. Acharya [3] on domination in graphoidal covers.
Key concepts: Cover (algebra), Path (computing), Disjoint sets, Point (geometry), Enhanced Data Rates for GSM Evolution, Combinatorics, Mathematics, Covering space