Suppose that a new company has five employees: Zamora, Agraharam, Smith, Chou, and Macintyre. Each employee will assume one of six responsibilities: planning, publicity, sales, marketing, development, and industry relations. Each employee is capable of doing one or more of these jobs: Zamora could do planning, sales, marketing, or industry relations; Agraharam could do planning or development; Smith could do publicity, sales, or industry relations; Chou could do planning, sales, or industry relations; and Macintyre could do planning, publicity, sales, or industry relations. Model the capabilities of these employees using a bipartite graph.

After we are done with that, we can start constructing the bipartite graph by making two column or two rows of group, one is for the person and the other is for responsibilities.

Later, we start match up each person to the responsibilities that assigned to them.

I attached the bipartite graph for this question as well.

olabrazanislam olabrazanislam · Answer 2 · 2019-12-21T19:08:16+01:00

Answer:

Following are the possible responsibilities of each of the five employees;

Zamora: Planning, Sales, Marketing, Industry relations

Agraharam: Planning, Development

Smith: Publicity, Sales, Industry relations

Chou: Publicity, Sales, Industry relations

Macintyre: Planning, Publicity, Sales, Industry relation

The vertices are the five employees and the six responsibilities areas. There is an edge between an employee and a responsibility, if the employee could execute the responsibility.

[tex]T_{1}[/tex] = {Zamora, Agraharam, Smith, Chou, Macintyre}

[tex]T_{2}[/tex]= {Planning, Publicity, Sales, Marketing, Development, Industry relations}

E = {(Zamora, Planning), (Zamora, Sales), (Zamora, Marketing), (Zamora, Industry relations), (Agraharam, Planning), (Agraham, Development), (Smith, Sales), (Smith, Publicity), (Smith, Industry relations) (Chou, Sales), (Chou, Publicity), (Chou, Industry relations), (Macintyre, Planning), (Macintyre, Sales), (Macintyre, Publicity), (Macintyre, Industry relations)}

Step-by-step explanation:

a bipartite graph is a simple graph whose vertices can be partitioned into two sets [tex]T_{1}[/tex] and [tex]T_{2}[/tex] such that there are no edges among the vertices of [tex]T_{1}[/tex] and no edges among the vertices of [tex]T_{2}[/tex], while there can be edges between a vertex of [tex]T_{1}[/tex] and a vertex of [tex]T_{2}[/tex]