Abstract
The object of this paper is to determine the minimum possible number of edges for a graph of order n and diameter at most four having the property that by suppressing any vertex the subgraph obtained has diameter at most λ ≥ 4. Results for λ ≥ 6 will be proved.
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.
