Graph G G is composed of vertices H , I , J , K , L H,I,J,K,L , and edges H I , H J , H K , I K , J K , J L , K L HI,HJ,HK,IK,JK,JL,KL . Which vertices are adjacent to vertex J J ?

Welcome to the practice. In this problem, we have a graph G that is composed of vertices H I J K and L and edges H I H J H K I K J K J L and KL. We'd like to know which vertices are adjacent to vertex J. Now, so far when we've answered these types of questions, we've typically had a picture of a graph and been asked to determine which vertices are adjacent to another vertex. So, one way to answer this question is to actually draw the graph that has these vertices and these edges, and then use it to answer the question. So, let's try doing that method here. Let's start by making our vertices. We have H. I J K and L. And as always, we can arrange these vertices in any way that we'd like, but I just have them generally close together in a circle to make it a bit easier to add in my edges. We have Edges HI. HJ HK I JK JL and KL. Now again, we want to know which vertices are adjacent to vertex J. So, we checked to see which vertices share an edge with vertex J. We can see that there is an edge between J and H, so H is adjacent. There's also an edge between J and K, so K is adjacent, and we have an edge from J to L, so L is also adjacent, and our adjacent vertices are H, K, and L. We don't have an edge from J to I, so they are not adjacent. Now, another way that we could have answered this question is by looking at our edges and seeing which ones include vertex J. Then we take the other vertex in that edge H, K, and L as the three vertices that are adjacent to vertex J. So that's a way to solve the problem if you don't want to draw the graph. I will say you should use whichever method makes it easier for you to answer the question. If you like having the picture, then draw the graph. But if you find it's not too bad to just look through the edges, that will work too. Great job.

Skip topic navigation

1. Critical Thinking & Problem Solving1h 59m

Inductive and Deductive Reasoning
46m

Estimation and Graphs
49m

Problem Solving
24m

2. Sets4h 25m

Basic Set Concepts and Notation
24m

The Empty Set
6m

Subsets
43m

Complement of a Set
23m

Intersections and Unions
1h 40m

Venn Diagrams and Operations with Three Sets
35m

Set Applications: Survey Problems
32m

3. Logic4h 33m

Statements and Negations
18m

Quantifiers
20m

Logical Connectives
1h 0m

If-Then Statements (Conditionals)
21m

Truth Tables for Negations, Conjunctions, and Disjunctions
42m

Truth Tables for If-Then Statements
29m

Equivalent Statements
30m

Logical Arguments
33m

Standard Forms of Arguments
15m

4. The Real Number System3h 5m

Integers & the Order of Operations
15m

Rational Numbers
39m

Irrational Numbers
16m

Dividing Square Roots
18m

Exponent Rules
1h 0m

Power Rules
34m

5. Algebra Review8h 43m

Evaluating Algebraic Expressions
15m

Simplifying Algebraic Expressions
1h 2m

Linear Equations
38m

Direct & Inverse Variation
27m

Linear Inequalities in One Variable
41m

Quadratic Equations
59m

Rectangular Coordinate System
28m

Intro to Functions and Notation
29m

Domain and Range
10m

Using Intercepts to Graph Lines
4m

Slope and Slope-Intercept Form
58m

Systems of Linear Equations
1h 25m

Systems of Linear Inequalities
37m

The Quadratic Formula
24m

9. Geometry3h 45m

Intro to Geometry
14m

Introduction to Angles
27m

Intro to Polygons
3m

Basics of Triangles
8m

Similar Figures
28m

Right Triangles and Pythagorean Theorem
9m

Perimeter and Area of Polygons
30m

Circles
23m

Special Right Triangles
20m

Trigonometry
39m

Intro to Fractals
18m

10. Voting and Apportionment3h 3m

Preference Ballots and the Plurality Method
29m

Borda Count Method
18m

Plurality With Elimination Method
15m

Pairwise Comparison Method
16m

Fairness Criterion
33m

Intro to Apportionment
26m

Hamilton's Method
16m

Jefferson's Method
15m

Alabama Paradox
12m

12. Graph Theory3h 1m

Intro to Graph Theory
31m

Degrees of Vertices
22m

Paths and Circuits
14m

Euler Paths and Euler Circuits
11m

Euler's Theorems
31m

Hamilton Paths and Hamilton Circuits
1h 9m

12. Graph Theory

Degrees of Vertices

Quantitative Reasoning

12. Graph Theory

Degrees of Vertices

이전 문제다음 문제

Quantitative Reasoning 때문에 힘들어하고 계신가요?

저희를 신뢰하는 수천 명의 학생들이 시험 합류하세요!

객관식

Graph $G$ is composed of vertices $H, I, J, K, L$ , and edges $H I, H J, H K, I K, J K, J L, K L$ .
Which vertices are adjacent to vertex $J$ ?

$H, I, L$

$H, J, L$

$H, J, K$

$H, K, L$

0 댓글

이전 문제다음 문제

2:59m

다음 시청

마스터 Degrees of Vertices Example 1가 Nick Kaneko 짧은 영상으로 설명해 줍니다

Quantitative Reasoning 때문에 힘들어하고 계신가요?

Graph GG is composed of vertices H,I,J,K,LH,I,J,K,L, and edges HI,HJ,HK,IK,JK,JL,KLHI,HJ,HK,IK,JK,JL,KL.Which vertices are adjacent to vertex JJ?

다음 시청

Graph $G$ is composed of vertices $H, I, J, K, L$ , and edges $H I, H J, H K, I K, J K, J L, K L$ .
Which vertices are adjacent to vertex $J$ ?