Abstract
A graph is a pair \(G=(V,E)\), where V is a non-empty set of vertices and E a set of edges, namely, a set of unordered pairs of distinct vertices. We say that two vertices \(x,y\in V\) are adjacent if \(\{x,y\}\in E\). In this case we also write \(x\sim y\). A graph \(G=(V,E)\) is called finite if V is a finite set.
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.
