Abstract
In this paper, we first extend the weighted handshaking lemma, using a generalization of the concept of the degree of vertices to the values of graphs. This edge-version of the weighted handshaking lemma yields an immediate generalization of the Mantel's classical result which asks for the maximum number of edges in triangle-free graphs to the class of $K_{4}$-free graphs. Then, by defining the concept of value for cliques (complete subgraphs) of higher orders, we also extend the classical result of Mantel for any graph $G$. We finally conclude our paper with a discussion about the possible future works.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.