. Now try this one Challenge:  Is this even possible?  One gets stuck….

Slides:



Advertisements
Similar presentations
Graphs CSCI 2720 Spring 2005.
Advertisements

Simple Graph Warmup. Cycles in Simple Graphs A cycle in a simple graph is a sequence of vertices v 0, …, v n for some n>0, where v 0, ….v n-1 are distinct,
Breadth-First Search Seminar – Networking Algorithms CS and EE Dept. Lulea University of Technology 27 Jan Mohammad Reza Akhavan.
Module 5 – Networks and Decision Mathematics Chapter 24 – Directed Graphs.
Pamela Leutwyler. A river flows through the town of Konigsburg. 7 bridges connect the 4 land masses. While taking their Sunday stroll, the people of Konigsburg.
Decision Maths Graphs Wiltshire Graphs A graph is just a diagram made up of “dots” and “lines”. These are all graphs. The dots are called “nodes” or.
NOTES: GRAPHING USING SLOPE & Y-INTERCEPT DAY 2. STEPS REWRITE IN SLOPE INTERCEPT FORM REWRITE IN SLOPE INTERCEPT FORM (Y = MX+B) LABEL SLOPE (M) AND.
CSE 321 Discrete Structures Winter 2008 Lecture 25 Graph Theory.
Dilations.
The Mathematics of Networks Chapter 7. Trees A tree is a graph that –Is connected –Has no circuits Tree.
1 Structures and Strategies for State Space Search 3 3.0Introduction 3.1Graph Theory 3.2Strategies for State Space Search 3.3Using the State Space to Represent.
The Inquiry Method for Social Science Research
A CB SHADING VENN DIAGRAMS Try these Venn Diagram shading questions involving 2 sets Question 1Question 2 Question 3Question 4.
SUNY Textbook Templates Milne Library, This work is licensed under the Creative Commons Attribution-ShareAlike 4.0 International License. To view.
1 2 Sets and Functions. The symbol means ‘is an element of’. Introduction to Set Theory In Mathematics, the word set refers to a group of numbers or other.
WARM-UP 11/24/09 1. GRAPH USING INTERCEPTS 3X – Y = 5 3X – Y = 5 2. FIND THE SLOPE OF THE LINE IN THE GRAPH 3. FIND THE SLOPE OF THE LINE THRU THE POINTS.
5.1  Routing Problems: planning and design of delivery routes.  Euler Circuit Problems: Type of routing problem also known as transversability problem.
Representing and Using Graphs
Translations Translations and Getting Ready for Reflections by Graphing Horizontal and Vertical Lines.
Knowledge Representation CPTR 314. The need of a Good Representation  The representation that is used to represent a problem is very important  The.
Chapter 2: Graphs and Networks Lesson 2: Hello Mr Euler…
Graphs, Puzzles, & Map Coloring
Social Networks. 2 A social network is a social structure made up of individuals or organizations (called "nodes“), which are tied (connected) by one.
Computer Science: A Structured Programming Approach Using C Graphs A graph is a collection of nodes, called vertices, and a collection of segments,
Reflections. Reflect the shape across the x axis Graph the following coordinates, then connect the dots (2,3) (2,5) (5,5) (5,6) (7,4) (5,2)(5,3) What.
The Structure of the Web. Getting to knowing the Web How big is the web and how do you measure it? How many people use the web? How many use search engines?
Topics Paths and Circuits (11.2) A B C D E F G.
Introduction to Graph Theory
Graph Theory. A branch of math in which graphs are used to solve a problem. It is unlike a Cartesian graph that we used throughout our younger years of.
UNIT 2 LESSON 6 CS PRINCIPLES. UNIT 2 LESSON 6 OBJECTIVES Students will be able to: Write an algorithm for solving the minimum spanning tree (MST) problem.
Generators Lesson!  This will be broken into multiple parts  The kids will be attempting to recreate a graph based on given data, but not being allowed.
Graph theory and networks. Basic definitions  A graph consists of points called vertices (or nodes) and lines called edges (or arcs). Each edge joins.
Euler Paths and Circuits. The original problem A resident of Konigsberg wrote to Leonard Euler saying that a popular pastime for couples was to try.
Graphs G = (V,E) V is the vertex set. Vertices are also called nodes and points. E is the edge set. Each edge connects two different vertices. Edges are.
Chapter 6: Graphs 6.1 Euler Circuits
Review Euler Graph Theory: DEFINITION: A NETWORK IS A FIGURE MADE UP OF POINTS (VERTICES) CONNECTED BY NON-INTERSECTING CURVES (ARCS). DEFINITION: A VERTEX.
Translations. Graph the following coordinates, then connect the dots (-8,0) (-5,0) (-5,1) (-3,-1) (-5,-3) (-5,-2)(-8,-2)
What Is a Cell?. Activity 3: What Is a Cell? Get Started  What do cells look like?  What are cells made of?  What do cells do? Write or sketch your.
Chapter Graphs and Graph Models
David Stotts Computer Science Department UNC Chapel Hill.
Equations, Symbols and Graphs Unit 1 – Introduction to Physics.
Graph problems Prof. Ramin Zabih
Graphs Definition: a graph is an abstract representation of a set of objects where some pairs of the objects are connected by links. The interconnected.
Scientific Methods I Peter Popper plants prodigious plots of pea plants. Every week Peter measures the height of his pea plants and records the results.
Graphing Function Charts. X Y I Y = 2X + 1 X Y ½ Y - intercept 0, 1 X - intercept -½, 0.
Programming Abstractions Cynthia Lee CS106B. Upcoming Topics Graphs! 1.Basics  What are they? How do we represent them? 2.Theorems  What are some things.
Pre-Lesson thinking… Any root with -ology? Topology.
Ebby Baby. Identifying similarities and differences is an instructional strategy that researchers say is basic to human thought. The average effect size.
Basic Concepts Graphs For more notes and topics visit:
Graphs and Graph Models

Venn Diagram large Graphs
Network Notes Ms Allan 2012 AS91260 (2.5) Designed to teach from,
Structural balance.
Graph Theory By Amy C. and John M..
Konigsberg- in days past.
Decision Maths Graphs.
Discrete Mathematics Lecture 6: Set and Function
Discrete Mathematics Lecture 12: Graph Theory
CS224w: Social and Information Network Analysis
Networks Kruskal’s Algorithm
Prepared by: Mahmoud Rafeek Al-Farra
Chapter 15 Graph Theory © 2008 Pearson Addison-Wesley.
Different kinds of graphs
(a) Venn diagram showing the degree of overlap of the following different approaches: G-test for significant differences between groups (with Bonferroni.
Communities Lets recreate a Community
Quadratic Graphs.
HIF-1α is not required for the classic transcriptional response to hypoxia. HIF-1α is not required for the classic transcriptional response to hypoxia.
EMIS 8374 Max-Flow in Undirected Networks Updated 18 March 2008
Presentation transcript:

Now try this one

Challenge:  Is this even possible?  One gets stuck….

You have been creating graphs  This is a special type of graph represented by what are called nodes and edges.  Nodes: are the point or shape that was being connected sometimes called vertices  Edges: are the lines that connect the nodes sometimes referred to as arcs.  The entire picture/graph is called a network.

What do we observe about nodes and edges?  What do you observe about the graph?  What possible reason can you give for this observations? Some of the nodes are different sizes The number of connections a node has changes the size of the node

Network Generators  Recreate an already known network based on a set of instructions.  Sometimes these generators group them into communities based on the relationships between nodes.  Sometimes the communities are overlapping or in the style of a Venn Diagram.  We will be learning what these different graphs look like and recreating our own networks to show a relationship within science topics.

Relationship  Nodes that are connected have a relationship.  One node that has many nodes connected to it creates a community.  How many communities do you see in the graph to the right?

Venn Diagrams in Graph Theory

Can you label the nodes, edges, and communities?

Nodes: Dots Edges: Lines