Graph theory is the study of graphs, which are mathematical structures used to model pairwise relations between objects. This document defines several key graph concepts, including types of graphs (directed, undirected, bipartite), graph terminology (vertices, edges, degree), theorems about graphs, and examples of special graphs (complete graphs, cycles, wheels, n-cubes, complete bipartite graphs). It provides examples of how graph theory is applied in fields like computer networks, chemistry, and scheduling.
In mathematics, graph theory is the study of graphs, which are mathematical structures used to model pairwise relations between objects.Graph theory is also important in real life.
In mathematics, graph theory is the study of graphs, which are mathematical structures used to model pairwise relations between objects.Graph theory is also important in real life.
The Team Member and Guest Experience - Lead and Take Care of your restaurant team. They are the people closest to and delivering Hospitality to your paying Guests!
Make the call, and we can assist you.
408-784-7371
Foodservice Consulting + Design
Senior Project and Engineering Leader Jim Smith.pdfJim Smith
I am a Project and Engineering Leader with extensive experience as a Business Operations Leader, Technical Project Manager, Engineering Manager and Operations Experience for Domestic and International companies such as Electrolux, Carrier, and Deutz. I have developed new products using Stage Gate development/MS Project/JIRA, for the pro-duction of Medical Equipment, Large Commercial Refrigeration Systems, Appliances, HVAC, and Diesel engines.
My experience includes:
Managed customized engineered refrigeration system projects with high voltage power panels from quote to ship, coordinating actions between electrical engineering, mechanical design and application engineering, purchasing, production, test, quality assurance and field installation. Managed projects $25k to $1M per project; 4-8 per month. (Hussmann refrigeration)
Successfully developed the $15-20M yearly corporate capital strategy for manufacturing, with the Executive Team and key stakeholders. Created project scope and specifications, business case, ROI, managed project plans with key personnel for nine consumer product manufacturing and distribution sites; to support the company’s strategic sales plan.
Over 15 years of experience managing and developing cost improvement projects with key Stakeholders, site Manufacturing Engineers, Mechanical Engineers, Maintenance, and facility support personnel to optimize pro-duction operations, safety, EHS, and new product development. (BioLab, Deutz, Caire)
Experience working as a Technical Manager developing new products with chemical engineers and packaging engineers to enhance and reduce the cost of retail products. I have led the activities of multiple engineering groups with diverse backgrounds.
Great experience managing the product development of products which utilize complex electrical controls, high voltage power panels, product testing, and commissioning.
Created project scope, business case, ROI for multiple capital projects to support electrotechnical assembly and CPG goods. Identified project cost, risk, success criteria, and performed equipment qualifications. (Carrier, Electrolux, Biolab, Price, Hussmann)
Created detailed projects plans using MS Project, Gant charts in excel, and updated new product development in Jira for stakeholders and project team members including critical path.
Great knowledge of ISO9001, NFPA, OSHA regulations.
User level knowledge of MRP/SAP, MS Project, Powerpoint, Visio, Mastercontrol, JIRA, Power BI and Tableau.
I appreciate your consideration, and look forward to discussing this role with you, and how I can lead your company’s growth and profitability. I can be contacted via LinkedIn via phone or E Mail.
Jim Smith
678-993-7195
jimsmith30024@gmail.com
The case study discusses the potential of drone delivery and the challenges that need to be addressed before it becomes widespread.
Key takeaways:
Drone delivery is in its early stages: Amazon's trial in the UK demonstrates the potential for faster deliveries, but it's still limited by regulations and technology.
Regulations are a major hurdle: Safety concerns around drone collisions with airplanes and people have led to restrictions on flight height and location.
Other challenges exist: Who will use drone delivery the most? Is it cost-effective compared to traditional delivery trucks?
Discussion questions:
Managerial challenges: Integrating drones requires planning for new infrastructure, training staff, and navigating regulations. There are also marketing and recruitment considerations specific to this technology.
External forces vary by country: Regulations, consumer acceptance, and infrastructure all differ between countries.
Demographics matter: Younger generations might be more receptive to drone delivery, while older populations might have concerns.
Stakeholders for Amazon: Customers, regulators, aviation authorities, and competitors are all stakeholders. Regulators likely hold the greatest influence as they determine the feasibility of drone delivery.
Oprah Winfrey: A Leader in Media, Philanthropy, and Empowerment | CIO Women M...CIOWomenMagazine
This person is none other than Oprah Winfrey, a highly influential figure whose impact extends beyond television. This article will delve into the remarkable life and lasting legacy of Oprah. Her story serves as a reminder of the importance of perseverance, compassion, and firm determination.
Artificial intelligence (AI) offers new opportunities to radically reinvent the way we do business. This study explores how CEOs and top decision makers around the world are responding to the transformative potential of AI.
2. Varying Applications (examples)
• Computer networks
• Distinguish between two chemical compounds with the same
molecular formula but different structures
• Solve shortest path problems between cities
• Scheduling exams and assign channels to television stations
4. Definitions - Graph
A generalization of the simple concept of a set of
dots, links, edges or arcs.
Representation: Graph G =(V, E) consists set of vertices denoted by V,
or by V(G) and set of edges E, or E(G)
5. Definitions – Edge Type
Directed: Ordered pair of vertices. Represented as (u, v) directed from vertex u to v.
Undirected: Unordered pair of vertices. Represented as {u, v}. Disregards any sense of direction
and treats both end vertices interchangeably.
u v
u v
6. Definitions – Edge Type
• Loop: A loop is an edge whose endpoints are equal i.e., an edge joining a vertex
to it self is called a loop. Represented as {u, u} = {u}
• Multiple Edges: Two or more edges joining the same pair of vertices.
u
7. Definitions – Graph Type
Simple (Undirected) Graph: consists of V, a nonempty set of vertices,
and E, a set of unordered pairs of distinct elements of V called edges
(undirected)
Representation Example: G(V, E), V = {u, v, w}, E = {{u, v}, {v, w}, {u, w}}
u v
w
8. Definitions – Graph Type
Multigraph: G(V,E), consists of set of vertices V, set of Edges E and a
function f from E to {{u, v}| u, v V, u ≠ v}. The edges e1 and e2 are
called multiple or parallel edges if f (e1) = f (e2).
Representation Example: V = {u, v, w}, E = {e1, e2, e3}
u
v
w
e1
e2
e3
9. Definitions – Graph Type
Pseudograph: G(V,E), consists of set of vertices V, set of Edges E and a
function F from E to {{u, v}| u, v Î V}. Loops allowed in such a graph.
Representation Example: V = {u, v, w}, E = {e1, e2, e3, e4}
u
v
w
e1
e3
e2
e4
10. Definitions – Graph Type
Directed Graph: G(V, E), set of vertices V, and set of Edges E, that are
ordered pair of elements of V (directed edges)
Representation Example: G(V, E), V = {u, v, w}, E = {(u, v), (v, w), (w, u)}
u
w
v
11. Definitions – Graph Type
Directed Multigraph: G(V,E), consists of set of vertices V, set of Edges E
and a function f from E to {{u, v}| u, v V}. The edges e1 and e2 are
multiple edges if f(e1) = f(e2)
Representation Example: V = {u, v, w}, E = {e1, e2, e3, e4}
u
w
v
e1
e2
e3
e4
12. Definitions – Graph Type
Type Edges Multiple Edges
Allowed ?
Loops Allowed ?
Simple Graph undirected No No
Multigraph undirected Yes No
Pseudograph undirected Yes Yes
Directed Graph directed No Yes
Directed
Multigraph
directed Yes Yes
13. Terminology – Undirected graphs
• u and v are adjacent if {u, v} is an edge, e is called incident with u and v. u and v are called endpoints of {u, v}
• Degree of Vertex (deg (v)): the number of edges incident on a vertex. A loop contributes twice to the degree (why?).
• Pendant Vertex: deg (v) =1
• Isolated Vertex: deg (k) = 0
Representation Example: For V = {u, v, w} , E = { {u, w}, {u, v} }, deg (u) = 2, deg (v) = 1, deg (w) = 1, deg (k) = 0, w and v are pendant , k is isolated
u
k
w
v
14. Terminology – Directed graphs
• For the edge (u, v), u is adjacent to v OR v is adjacent from u, u – Initial vertex, v – Terminal vertex
• In-degree (deg- (u)): number of edges for which u is terminal vertex
• Out-degree (deg+ (u)): number of edges for which u is initial vertex
Note: A loop contributes 1 to both in-degree and out-degree (why?)
Representation Example: For V = {u, v, w} , E = { (u, w), ( v, w), (u, v) }, deg- (u) = 0, deg+ (u) = 2, deg- (v) = 1,
deg+ (v) = 1, and deg- (w) = 2, deg+ (u) = 0
u
w
v
16. Theorems: Undirected Graphs
Theorem 2:
An undirected graph has even number of vertices with odd degree
even
V
oof
2
2
1
V
v
1,
V
v
V
u
V
v
deg(u)
term
second
even
also
is
term
second
Hence
2e.
is
sum
since
even
is
inequality
last
the
of
side
hand
right
on the
terms
last two
the
of
sum
The
even.
is
inequality
last
the
of
side
hand
right
in the
first term
The
V
for v
even
is
(v)
deg
deg(v)
deg(u)
deg(v)
2e
vertices
degree
odd
to
refers
V2
and
vertices
degree
even
of
set
the
is
1
Pr
18. Simple graphs – special cases
• Complete graph: Kn, is the simple graph that contains exactly one edge
between each pair of distinct vertices.
Representation Example: K1, K2, K3, K4
K2
K1
K4
K3
19. Simple graphs – special cases
• Cycle: Cn, n ≥ 3 consists of n vertices v1, v2, v3 … vn and edges {v1, v2},
{v2, v3}, {v3, v4} … {vn-1, vn}, {vn, v1}
Representation Example: C3, C4
C3 C4
20. Simple graphs – special cases
• Wheels: Wn, obtained by adding additional vertex to Cn and
connecting all vertices to this new vertex by new edges.
Representation Example: W3, W4
W3 W4
21. Simple graphs – special cases
• N-cubes: Qn, vertices represented by 2n bit strings of length n. Two
vertices are adjacent if and only if the bit strings that they represent
differ by exactly one bit positions
Representation Example: Q1, Q2
0
10
1
00
11
Q1
01
Q2
22. Bipartite graphs
• In a simple graph G, if V can be partitioned into two disjoint sets V1 and V2 such that
every edge in the graph connects a vertex in V1 and a vertex V2 (so that no edge in G
connects either two vertices in V1 or two vertices in V2)
Application example: Representing Relations
Representation example: V1 = {v1, v2, v3} and V2 = {v4, v5, v6},
v1
v2
v3
v4
v5
v6
V1
V2
23. Complete Bipartite graphs
• Km,n is the graph that has its vertex set portioned into two subsets of m
and n vertices, respectively There is an edge between two vertices if
and only if one vertex is in the first subset and the other vertex is in the
second subset.
Representation example: K2,3, K3,3
K2,3 K3,3