Convex extendable trees

DOI10.1016/S0012-365X(98)00404-XMaRDI QIDQ1304821zbMATH OpenOpenAlexFDO

Authors K. S. Parvathy, A. Vijayakumar

Publication date 30 January 2000

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0012-365x(98)00404-x

zbMATH Keywords

convex extendable treedistance convex simple graphgeodesic convexityminimal path convexity

Mathematics Subject Classification ID

Trees (05C05) Distance in graphs (05C12) Paths and cycles (05C38)

Review text

A graph is distance convex simple if all its nontrivial convex vertex sets (i.e. containing all shortest paths between any of its pairs) are pairs. A tree is convex extendable if it is a spanning tree of a convex simple graph. It is shown that all trees up to order nine are convex extendable, as well as any tree of diameter three or five, and those of diameter four of which the central vertex has even degree. A similar question for minimal path convexity (replacing shortest paths by chordless paths) is also investigated.

Recommendations

• scientific article; zbMATH DE number 3786820
• On local convexity in graphs
• Publication:4207928
• scientific article; zbMATH DE number 3882484
• Steiner distance and convexity in graphs

Cited in

(4)

• Pretrees and arborescent convexities
• Reconstructing trees from digitally convex sets
• Trees with Convex Faces and Optimal Angles
• Convex labelings of trees

This page was built for publication: Convex extendable trees

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