On the Pendant Number of Certain Graphs
P. G. R. S. Ranasinghe, L. R. M. K. R. Jayathilaka
Journal of Advances in Mathematics and Computer Science · pp. 33–41 · Published 27 Feb 2023
10.9734/jamcs/2023/v38i41756Abstract
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.
Cited by 0
No indexed citations yet.
Related research
- Molecular Biology Methods to Assess Microbiological Hazard Concerning Objects of Cultural Heritage — shares topic coverage
- Growth and Decomposition of Onion Production in Maharashtra, India — shares topic coverage
- Effect of Climate, Growth and Decomposition Analysis of Maize in India — shares topic coverage
- Does Income Diversification Reduce Poverty in Rural Households? — shares topic coverage
- Сomposition and Rheological Properties of Decomposition Products of Low Grade Phosphorite with Phosphoric Acid — shares topic coverage
Article metrics
Real usage data collected on this platform.
0
Page views
0
PDF downloads
0
Outbound clicks
0
Citations
Views by country
Approximate, from request IP at view time — not citizenship or institution. Countries with fewer than 5 views are grouped as "Other".
No views recorded yet.
Traffic sources
Referring site, by host.
No traffic recorded yet.
Views and downloads exclude known bots/crawlers. Citations combines this platform's own DOI-resolved index with each external source's own reported total — see Cited by above for individually listed citing works. Last refreshed 0 seconds ago.