Abstract
For a given graph [Formula: see text], denote by [Formula: see text] and [Formula: see text] the order of the largest component and the number of connected components of [Formula: see text], respectively. The scattering number of [Formula: see text] is defined as [Formula: see text]. The tenacity of [Formula: see text] is defined as [Formula: see text]. These two theoretical parameters are important combinatorial parameters for measuring the vulnerability of networks. In this paper, we determine the scattering number and tenacity of [Formula: see text]-uniform linear hypergraph [Formula: see text].
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.
