Abstract
Publisher Summary This chapter describes constructions of sensitive graphs, which are not strongly sensitive. It introduces various classes of graphs in terms of their closed-set lattices. While strongly sensitive graphs are abundant, not every graph is maximally critical or minimally critical. There exist maximally critical graphs that are not minimally critical and vice versa. The chapter introduces some methods of construction that produce various families of sensitive graphs that are not strongly sensitive. All graphs are assumed to be finite, nontrivial, and simple. The chapter also describes the construction of a class of sensitive rambutans that are not strongly sensitive.
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.
