Ranasinghe, P. G. R. S. and Jayathilaka, L. R. M. K. R. (2023) On the Pendant Number of Certain Graphs. Journal of Advances in Mathematics and Computer Science, 38 (4). pp. 33-41.
![[thumbnail of Ranasinghe3842022JAMCS96295.pdf]](http://journal.article2publish.com/style/images/fileicons/text.png)
Text
Ranasinghe3842022JAMCS96295.pdf - Published Version
Download (489kB)
Abstract
The present study investigates the pendant number of certain graph classes; complement, line graphs, and total graphs. The pendant number is the minimum number of end vertices of paths in a path decomposition of a graph. A path decomposition of a graph is a decomposition of it into subgraphs; i.e., a sequence of a subset of vertices of the graph such that the endpoints of each edge appear in one of the subsets and each vertex appears in an adjacent sub-sequence of the subsets.
| Item Type: | Article |
|---|---|
| Subjects: | Universal Eprints > Mathematical Science |
| Depositing User: | Managing Editor |
| Date Deposited: | 04 Mar 2023 04:49 |
| Last Modified: | 07 Feb 2024 04:17 |
| URI: | http://journal.article2publish.com/id/eprint/1486 |
Actions (login required)
- View Item