The following questions are mostly on the topic of vertex degrees. (a) Let H be a (8, 13)-graph with 8(H) = 2 and A(H) = 4. Denote by ni the number of vertices in H of degree i, where i = 2,3,4. Assume that n3 ≥ 1. Find all possible answers for (n2, n3, n4). For each of your answers, construct a corresponding graph. (b) Suppose G is a k-regular (n, m )-graph, where k > 0, m ≥ 0 and n ≥ 1. Find a relation linking k, n and m. Justify your answer. (c) Let G be a 3-regular graph with e(G) = 2v(G) – 3. Determine the values of v(G) and e(G). Construct all such graphs G. (d) Let G be a graph of order n in which there exists no three vertices u, v, w such that uv, vw and wu are all edges in G. Show that n≥ 8(G) + A(G).

College Algebra (MindTap Course List)
12th Edition
ISBN:9781305652231
Author:R. David Gustafson, Jeff Hughes
Publisher:R. David Gustafson, Jeff Hughes
Chapter5: Exponential And Logarithmic Functions
Section5.3: Logarithmic Functions And Their Graphs
Problem 137E
icon
Related questions
Question
The following questions are mostly on the topic of vertex degrees.
(a) Let H be a (8, 13)-graph with 8(H) = 2 and A(H) = 4. Denote by ni the number
of vertices in H of degree i, where i = 2,3,4. Assume that n3 ≥ 1. Find all possible
answers for (n2, n3, n4). For each of your answers, construct a corresponding graph.
(b) Suppose G is a k-regular (n, m )-graph, where k > 0, m ≥ 0 and n ≥ 1. Find a
relation linking k, n and m. Justify your answer.
(c) Let G be a 3-regular graph with e(G) = 2v(G) – 3. Determine the values of v(G)
and e(G). Construct all such graphs G.
(d) Let G be a graph of order n in which there exists no three vertices u, v, w such that
uv, vw and wu are all edges in G. Show that n≥ 8(G) + A(G).
Transcribed Image Text:The following questions are mostly on the topic of vertex degrees. (a) Let H be a (8, 13)-graph with 8(H) = 2 and A(H) = 4. Denote by ni the number of vertices in H of degree i, where i = 2,3,4. Assume that n3 ≥ 1. Find all possible answers for (n2, n3, n4). For each of your answers, construct a corresponding graph. (b) Suppose G is a k-regular (n, m )-graph, where k > 0, m ≥ 0 and n ≥ 1. Find a relation linking k, n and m. Justify your answer. (c) Let G be a 3-regular graph with e(G) = 2v(G) – 3. Determine the values of v(G) and e(G). Construct all such graphs G. (d) Let G be a graph of order n in which there exists no three vertices u, v, w such that uv, vw and wu are all edges in G. Show that n≥ 8(G) + A(G).
Expert Solution
steps

Step by step

Solved in 2 steps with 4 images

Blurred answer
Recommended textbooks for you
College Algebra (MindTap Course List)
College Algebra (MindTap Course List)
Algebra
ISBN:
9781305652231
Author:
R. David Gustafson, Jeff Hughes
Publisher:
Cengage Learning
Algebra and Trigonometry (MindTap Course List)
Algebra and Trigonometry (MindTap Course List)
Algebra
ISBN:
9781305071742
Author:
James Stewart, Lothar Redlin, Saleem Watson
Publisher:
Cengage Learning
Holt Mcdougal Larson Pre-algebra: Student Edition…
Holt Mcdougal Larson Pre-algebra: Student Edition…
Algebra
ISBN:
9780547587776
Author:
HOLT MCDOUGAL
Publisher:
HOLT MCDOUGAL
Algebra: Structure And Method, Book 1
Algebra: Structure And Method, Book 1
Algebra
ISBN:
9780395977224
Author:
Richard G. Brown, Mary P. Dolciani, Robert H. Sorgenfrey, William L. Cole
Publisher:
McDougal Littell
Algebra & Trigonometry with Analytic Geometry
Algebra & Trigonometry with Analytic Geometry
Algebra
ISBN:
9781133382119
Author:
Swokowski
Publisher:
Cengage
College Algebra
College Algebra
Algebra
ISBN:
9781337282291
Author:
Ron Larson
Publisher:
Cengage Learning