Maximum Linear Forest of Graphs Resulting from Some Binary Operations
Asian Research Journal of Mathematics · pp. 1–6 · Published 25 Jul 2023
10.9734/arjom/2023/v19i10720Abstract
For a connected nontrivial graph G, the maximum linear forest of G is the linear forest having maximum number of edges. The number of edges in a maximum linear forest is denoted by \(\ell\)`(G). In this paper we determine the maximum linear forest of the join and union of nontrivial connected graphs G and H , denoted by G + H and G \(\cup\) H , respectively.
Cited by 0
No indexed citations yet.
Related research
- Independent Semitotal Domination in the Join of Graphs — 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.