Abstract
The integrity of a graph [Formula: see text] is defined as the minimum value of [Formula: see text] taken over all [Formula: see text], where [Formula: see text] denotes the maximum cardinality of a component of graph [Formula: see text]. In this paper, we investigate bounds on the maximum and minimum values of the weighted version of this parameter. We also consider the same question for the related parameter vertex-neighbor-integrity.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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 call
