Abstract

G being a graph, we define its cyclomatic cohesion γ( G). Then, using Tseitin's method (1970), we construct a contradictory formula C( G) and prove our main theorem: Every resolution of C( G) contains, at least, 2 γ( G) distinct clauses. A similar result was obtained by Urquhart (1987) with a different method valid only for a specific family of graphs.

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

Disclaimer: 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.