Characterisation of trees with exactly one diametral path

DOI10.1007/S44427-025-00005-4MaRDI QIDQ6947194zbMATH OpenFDO

Authors B. M. Abhinaya, Tabitha Agnes Mangam

Publication date 5 August 2025

Published in Acta Universitatis Sapientiae. Informatica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S44427-025-00005-4

zbMATH Keywords

diameterdiametral pathmaximal path decompositiontrees

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Review text

The authors in this paper probe trees with only one diametral path. For such trees, they obtain lower and upper bounds for the independence number and also find lower and upper bounds for the number of degree one vertices and the number of cut vertices of such trees. They also establish that if the diameter of such trees is four or five, then they have a caterpillar. The authors also derive a necessary and sufficient condition for a tree to have a maximal path decomposition. Further, they also construct an algorithm to find the maximal path decomposition index of trees and indicate the scope for further research.

Cites work

• Decomposition of graph into diametral paths
• Equitable path decomposition of graphs
• Euler numbers and diametral paths in Fibonacci cubes, Lucas cubes and Alternate Lucas cubes
• Graph theory and decomposition
• Graphoidal covers and graphoidal covering number of a graph
• scientific article; zbMATH DE number 194437 (Why is no real title available?)
• scientific article; zbMATH DE number 3404271 (Why is no real title available?)
• scientific article; zbMATH DE number 7646025 (Why is no real title available?)
• Path decompositions of tournaments
• The problem of path decomposition for graphs with treewidth at most 4

This page was built for publication: Characterisation of trees with exactly one diametral path

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6947194)