Abstract
A convex subgraph of a connected graph G is a subgraph of G induced by a convex subset of V (G). For a proper convex subgraph H of G, we say that G is H-covex k-accessible if for every vertex v ∈ V (G) \V (H), the distance between v and H in G is at most k. The H-convex accessibility number of G is the minimum k for which G is Hconvex k-accessible. In this paper, we established sharp bounds for the H-convex accessibility number of graphs and characterized graphs with H-convex accessibility number equal to some positive integer. Moreover, we established results on the H-convex accessibility numbers of some special graphs.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
