Abstract
For a given graph [Formula: see text], by [Formula: see text] and [Formula: see text] denote the order of the largest component and the number of connected components of [Formula: see text], respectively. The rupture degree of [Formula: see text] is an important combinatorial parameters, which defined as [Formula: see text]. Clearly, the smaller the value [Formula: see text] is, the better the connectivity of graph [Formula: see text] is. In this paper, the tree structures with minimum rupture degree be discussed, and the extremal graphs on the rupture degree in terms of graph girth are also characterized.
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.
