A forest has three components and nine vertices. How many edges
does it have? Explain. It...
A forest has three components and nine vertices. How many edges
does it have? Explain. It is not enough to give an example; you
must show that all examples of such a forest have the asserted
number of edges.
Consider an undirected graph G that has n distinct
vertices. Assume n≥3.
How many distinct edges will there be in any circuit for G that
contains all the vertices in G?
What is the maximum degree that any vertex in G can have?
What is the maximum number of distinct edges G can have?
What is the maximum number of distinct edges that G can have if
G is disconnected?
Assume that in addition to having capacities for edges we have
capacities for vertices, meaning that the incoming flow to a vertex
cannot be more that its capacity. Describe an efficient algorithm to
solve the max-flow problem in such a network.
How many electrons does a neutral potassium atom have? How
many protons? How many electrons does a neutral fluorine atom have?
What happens in the molecule of potassium fluoride?
There are many components of a 10K filing. Pick three components
that you find are the most important and explain why? Can you find
them in the annual report as well? If not, why? Take a look at your
fellow students responses and provide feedback to others.
TeF5- anion.
a) How many valence electrons does Te have?
b) How many valence electrons does F have?
c) Write the Lewis structure of TeF5 - anion:
d) Assign formal charges to each atom in the Lewis structure of
the TeF5 - anion.
e) What is the hybridization of the orbitals on the central atom
in the anion TeF5 -?
d) Predict the molecular geometry of the TeF5 - anion: