This is a probably a no brainer, and I’ve been searching but can’t seem to find an answer. What is the term (and any alternate terms) for a graph with only two vertices and only one edge between them?
This is not a homework question 🙂
Share
Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
This is a probably a no brainer, and I’ve been searching but can’t seem to find an answer. What is the term (and any alternate terms) for a graph with only two vertices and only one edge between them?
This is not a homework question 🙂
The complete graph on 2 vertices. Denoted K2. See: http://en.wikipedia.org/wiki/Complete_graph