A note on the convexity number of the complementary prisms of trees

DOI10.1016/j.dam.2021.07.033zbMath1494.05040arXiv2004.04638OpenAlexW3191123507MaRDI QIDQ2161269

Ullas Chandran S. V., Neethu P. K.

Publication date: 4 August 2022

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2004.04638

zbMATH Keywords

treegeodesicconvex setconvexity number

Mathematics Subject Classification ID

Trees (05C05) Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12) Other problems of combinatorial convexity (52A37)

Related Items (1)

On the monophonic convexity in complementary prisms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Complexity properties of complementary prisms
• Convex sets in lexicographic products of graphs
• Domination and total domination in complementary prisms
• The theory of convex geometries
• Some remarks on the convexity number of a graph
• A lower bound for the convexity number of some graphs
• The convexity number of a graph
• Spectra, signless Laplacian and Laplacian spectra of complementary prisms of graphs
• Convex sets under some graph operations
• On the convexity number of graphs
• Cycles in complementary prisms
• Geodesic Convexity in Graphs
• Convexity in Graphs and Hypergraphs
• Some results on the b-chromatic number in complementary prism graphs

This page was built for publication: A note on the convexity number of the complementary prisms of trees