G = (V,E) where V(G) = {a,b, c, d, e, f }and E(G) = {ae,bc,bd, cd, fb, fd,cc}. . The vertex set is the set of six Fibonacci numbers S = {2,3,5,8,13,21} and for i, j e S, {i,j} € E if and only if i+j€S or |i – j| E S. %3D 1 00 10)

Advanced Engineering Mathematics
10th Edition
ISBN:9780470458365
Author:Erwin Kreyszig
Publisher:Erwin Kreyszig
Chapter2: Second-order Linear Odes
Section: Chapter Questions
Problem 1RQ
icon
Related questions
Question
Hi! Our teacher sent us sample questions we can practice for our upcoming test next week. Can you help me understand this? Thank you!
Make a graph/graph model for each of the following. Determine the order and size of each graph
model.
1. G = (V,E) where V(G) = {a, b, c, d, e, ƒ } and E (G) = {ae, bc, bd,cd, fb, fd,cc}.
2. The vertex set is the set of six Fibonacci numbers S = {2,3,5,8,13,21} and for i, j e S, {i,j} €
E if and only if i+j€S or |i – j| E S.
3. A major publishing company has ten editors (referred to by 1,2,3,..,10) divided into seven
committees as follows: c = {1,2,3}, c2 = {1,3,4,5}, c3 = {2,5,6,7}, C4 = {4,7,8,9},
C5 = {2,6,7}, c6 = {8,9,10}, c, = {1,3,9,10}. Represent the committees as vertices and
CiCj
is
an edge if and only if they have a common member.
What is a logical question to ask in this situation which is answerable by analyzing the graph
model ?
4. Let V = {act, aim, arc, arm, art, car, cat, oar, oat, rat, tar}, a collection of 3-letter words be
the vertices. Two elements of V form an edge iff they are transformations of each other. The
word W; is a transformation of W; if W; is obtained from W; by performing exactly one of
the following steps:
(1) Interchanging two letters of W; (i.e., act and cat are transformations of each other);
(2) Replacing a letter in W; by another letter ( i.e., aim and arm are transformations of each
other).
Note: A graph is called a word graph if it is a graph of some set of words.
Transcribed Image Text:Make a graph/graph model for each of the following. Determine the order and size of each graph model. 1. G = (V,E) where V(G) = {a, b, c, d, e, ƒ } and E (G) = {ae, bc, bd,cd, fb, fd,cc}. 2. The vertex set is the set of six Fibonacci numbers S = {2,3,5,8,13,21} and for i, j e S, {i,j} € E if and only if i+j€S or |i – j| E S. 3. A major publishing company has ten editors (referred to by 1,2,3,..,10) divided into seven committees as follows: c = {1,2,3}, c2 = {1,3,4,5}, c3 = {2,5,6,7}, C4 = {4,7,8,9}, C5 = {2,6,7}, c6 = {8,9,10}, c, = {1,3,9,10}. Represent the committees as vertices and CiCj is an edge if and only if they have a common member. What is a logical question to ask in this situation which is answerable by analyzing the graph model ? 4. Let V = {act, aim, arc, arm, art, car, cat, oar, oat, rat, tar}, a collection of 3-letter words be the vertices. Two elements of V form an edge iff they are transformations of each other. The word W; is a transformation of W; if W; is obtained from W; by performing exactly one of the following steps: (1) Interchanging two letters of W; (i.e., act and cat are transformations of each other); (2) Replacing a letter in W; by another letter ( i.e., aim and arm are transformations of each other). Note: A graph is called a word graph if it is a graph of some set of words.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 1 images

Blurred answer
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Advanced Engineering Mathematics
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
Numerical Methods for Engineers
Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education
Introductory Mathematics for Engineering Applicat…
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
Mathematics For Machine Technology
Mathematics For Machine Technology
Advanced Math
ISBN:
9781337798310
Author:
Peterson, John.
Publisher:
Cengage Learning,
Basic Technical Mathematics
Basic Technical Mathematics
Advanced Math
ISBN:
9780134437705
Author:
Washington
Publisher:
PEARSON
Topology
Topology
Advanced Math
ISBN:
9780134689517
Author:
Munkres, James R.
Publisher:
Pearson,