SlideShare uma empresa Scribd logo
1 de 24
Graph Theory in
Football
INDEX
Concepts of Graph theory
Facts of Football
Graphical representation
Constructing graphs using data from
semi-finals
Predicting Spain’s win-Spain did
win!!
Reasons for the prediction
Degree Centrality
Betweenness Centrality
Centre
Conclusion


Graph: A simple graph G = (V, E) consists of V, a nonempty set of
vertices, and E, a set of unordered pairs of distinct elements of V
called edges.

Here 1,2,3 and 4 are the vertices
•a,

b, c and d are the edges



Arcs: An edge with a specified direction is called an arc



Path:

It is a sequence of edges which connect a
sequence of vertices




Directed Graph: A graph having arcs is called a directed
graph

Directed Network: A directed graph with integer
weight attached to each arc is called a
directed network.
FACTS OF FOOTBALL
• A team consists of exactly 1 goalkeeper, 3-5 defenders , 3-5
midfielders and 1-3 strikers
• A goalkeeper is a designated player charged with directly
preventing the opposing team from scoring by intercepting
shots at goal.

• A defender is an outfield player whose primary role is to
prevent the opposition from attacking.
• A mid-fielder plays in the middle of the field and does the
job of both defenders and strikers as per the need.
• A striker is a player who plays nearest to the opposing
team's goal, and is therefore principally responsible for scoring
goals
Graphical representation of the game.
We consider a football match to be analogous to a directed network.
• The players of the team are represented as the vertices.
• The passes exchanged between players are the arcs, the direction of the arc
will be in accordance with the direction of the pass.
• We assume that the weight of each arc is one .
• We assume that the diagraph will be a connected graph, i.e. every vertex is
adjacent to at least one other vertex in the graph.
• The network is a tool for visualizing a team’s
strategy by fixing its vertices in positions roughly corresponding
to the players’ formation on the pitch

 0,1,2,3,4,5 and 6 are the players.

 Arcs represent the passes between
players
Constructing the
Network World Cup
The data for the 2010 FIFA
games was downloaded from the
official FIFA website
The networks were then constructed and
analyzed using Wolfram Mathematica
As FIFA only provides the aggregate data
over all the games, these networks were
computed by dividing the number of passes by
the total number of games played by each
team.
The networks for the Netherlands and Spain drawn before
the final game, using the data and tactical formations of
the semi-finals.
I am out of
my JOB!!! 
The Factors used by us
for our Prediction:
Degree Centrality

Betweeness Centrality
Centre of a Graph
Degree Centrality .
Degree Centrality is the number of arcs
incident with a vertex.
 This concept can be extended to a player
by counting the number of passes he is
involved in.
N
E
T
H
E
R
L
A
N
D

Jersey no.
1
2
3
4
5
6
7
8
9
10
11
15

Jersey No.
1
3
5
S
6
7
P
8
A
11
I
14
N 15
16
18
9

Player Name
Stekelenburg
Van Der Wiel
Heitinga
Mathijsen
Van bronckhorst
Van Bommel
Dirk Kuyt
Nigel De Jong
Robin Van Persie
Wesley Sneijder
Arjen Robben
Braafheid (sub)

Player Name
Iker Casillas
Gerard Pique
Carlos Puyol
Andreas Iniestaa
David Villa
Xavi
Cap Devila
Xabi Alonso
Sergio Ramos
Sergio Busquets
Pedro
Fernando Torres (sub)

Position
Goalkeeper
Defender
Defender
Defender
Defender
Mid-Fielder
Forward
Mid-Fielder
Forward
Mid-Fielder
Forward
Defender

Position
Goal-Keeper
Defender
Defender
Mid-Fielder
Forward
Mid-Fielder
Defender
Mid-Fielder
Defender
Mid-Fielder
Forward
Forward

Centrality
48
31
27
33
29
29
11
32
19
35
14
4

Centrality
31
51
54
43
13
95
53
47
54
75
13
2
.

BETWEENNESS CENTRALITY

.



Betweenness centrality quantifies the number of
times a vertex acts as a bridge along the shortest
path between two other vertices.



Betweenness does not measure how well-connected
a player is, but rather how the ball-flow between
other players depends on that particular player.

It thus provides a measure of the impact of removing
that player from the game.
Player’s
betweenness scores
for Spain.

Player’s betweenness
scores for the
Netherlands

0.12
6.17
OBSERVATION
On the Spanish ,The S
betweenness scores are low and
uniformly distributed – a sign of a well-balanced passing
strategy
Concentrated betweenness scores that are on
the high side indicate a high dependence on few,
too important players, whereas well distributed,
low betweenness scores are an indication of a
well-balanced passing strategy.
The table gives us a good measure of the
game-play robustness. By Blocking players
with high betweenness centrality the opposing
team can interrupt a teams natural flow.
Centre
Eccentricity of a vertex: It is the maximum
distance of that vertex from any other vertex.
Graph Radius: It is the minimum distance
between any two vertices of the graph.

Centre of a graph: Those vertices whose
eccentricity equals the graph radius.
For a game of football, the centre will be the players whose
distance from other players is minimum( here assumed as
one)
The centre shall appear more in goal scoring attempts.
Graphical Analysis for a goal scoring
Opportunity:
(We define a successful pass as one that was involved in an attack, i.e. the
passes that resulted in shots on targets.)

Robben 

Sneijder 

Mapping Of the Dutch Attack.
Xavi 

Iniesta

Fabrega
s

Mapping Of The Spanish Attack
OBSERVATIONS

•The Spanish players make extremely large no. of
passes during the game as seen by the high network
density of their graph, much more than their Dutch
counterparts.
•The Spanish attack is often unpredictable because of
the huge number of passing outlets.
•The Dutch attack seems much more traditional with
most attacks being carried out by the strikers.
•The Spanish attack relies on swift passes between
the players, which are evenly distributed among the
midfield.
•The low no. of arcs in the Dutch team suggests a
preference for quick attacks and counter attacks.
Using Graph theory to map the football world cup final, we were able to
determine the primary reason for Spanish triumph.
1. Spain had a well oiled network of connected players which
made for a sound defense, a cohesive midfield and an effective
attack.
2. The Dutch lost because their strategy was predictable and
easily countered by Spanish who played a clever and an
intricate game.
3. They should have considered passing more and involving
players other than their attacking mid fielders and strikers in
their goal-striking strategy.
4. Similarly, the outcome of the game could have been different
had they succeed in blocking the players who belonged to the
Spanish center, namely, Xavi, Iniesta and Fabregas.
5. Finally, our observations showed an unbalanced use of the
pitch giving a clear preference for the left side by the Dutch.
Bibliography


Eclat-volume –III Mathematics Journal



Edgar. G. Goodaire and Micheal M. Parmenter, Discrete
Mathematics with graph theory 3rd Edition



http://www.maths.qmul.ac.uk/~ht/footballgraphs/holland
Vspain.html



http://plus.maths.org/content/os/latestnews/mayaug10/football/index



www.fifa.com/live/competitions/worldcup/matchday=25/
day=1/math=300061509/index.html
Prachi Singhal and Umang Aggarwal
Lady Shri Ram College

Mais conteúdo relacionado

Mais procurados

Slides Chapter10.1 10.2
Slides Chapter10.1 10.2Slides Chapter10.1 10.2
Slides Chapter10.1 10.2
showslidedump
 
Graph coloring and_applications
Graph coloring and_applicationsGraph coloring and_applications
Graph coloring and_applications
mohammad alkhalil
 
Graph theory
Graph theoryGraph theory
Graph theory
Kumar
 
basketball ppt (mark john camacho).pptx
basketball ppt (mark john camacho).pptxbasketball ppt (mark john camacho).pptx
basketball ppt (mark john camacho).pptx
MarkJohnCasibanCamac
 

Mais procurados (20)

Lec5
Lec5Lec5
Lec5
 
Slides Chapter10.1 10.2
Slides Chapter10.1 10.2Slides Chapter10.1 10.2
Slides Chapter10.1 10.2
 
Graph coloring Algorithm
Graph coloring AlgorithmGraph coloring Algorithm
Graph coloring Algorithm
 
graph.ppt
graph.pptgraph.ppt
graph.ppt
 
Graph Theory
Graph TheoryGraph Theory
Graph Theory
 
Introduction to Graph and Graph Coloring
Introduction to Graph and Graph Coloring Introduction to Graph and Graph Coloring
Introduction to Graph and Graph Coloring
 
OSI Model-info
OSI Model-infoOSI Model-info
OSI Model-info
 
Graph coloring
Graph coloringGraph coloring
Graph coloring
 
Unit 2: All
Unit 2: AllUnit 2: All
Unit 2: All
 
Graph coloring and_applications
Graph coloring and_applicationsGraph coloring and_applications
Graph coloring and_applications
 
Graph theory
Graph theoryGraph theory
Graph theory
 
Graph theory
Graph theoryGraph theory
Graph theory
 
Graph theory in network system
Graph theory in network systemGraph theory in network system
Graph theory in network system
 
Floyd Warshall Algorithm
Floyd Warshall AlgorithmFloyd Warshall Algorithm
Floyd Warshall Algorithm
 
Graph theory
Graph theory Graph theory
Graph theory
 
Real life application
Real life applicationReal life application
Real life application
 
Graph: Euler path and Euler circuit
Graph: Euler path and Euler circuitGraph: Euler path and Euler circuit
Graph: Euler path and Euler circuit
 
basketball ppt (mark john camacho).pptx
basketball ppt (mark john camacho).pptxbasketball ppt (mark john camacho).pptx
basketball ppt (mark john camacho).pptx
 
FIBA 3 Person-Basic- Part 1
FIBA 3 Person-Basic- Part 1FIBA 3 Person-Basic- Part 1
FIBA 3 Person-Basic- Part 1
 
Graph Theory Introduction
Graph Theory IntroductionGraph Theory Introduction
Graph Theory Introduction
 

Destaque

Application of graph theory in drug design
Application of graph theory in drug designApplication of graph theory in drug design
Application of graph theory in drug design
Reihaneh Safavi
 
the bike map - a look into a practical application of graph theory
the bike map - a look into a practical application of graph theorythe bike map - a look into a practical application of graph theory
the bike map - a look into a practical application of graph theory
Charlie Hsu
 
Applications of graphs
Applications of graphsApplications of graphs
Applications of graphs
Tech_MX
 
introduction to graph theory
introduction to graph theoryintroduction to graph theory
introduction to graph theory
Chuckie Balbuena
 
Chromatic graph theory
Chromatic graph theoryChromatic graph theory
Chromatic graph theory
jotasmall
 

Destaque (20)

Graph theory and life
Graph theory and lifeGraph theory and life
Graph theory and life
 
Application of graph theory in drug design
Application of graph theory in drug designApplication of graph theory in drug design
Application of graph theory in drug design
 
Graph theory in Practise
Graph theory in PractiseGraph theory in Practise
Graph theory in Practise
 
the bike map - a look into a practical application of graph theory
the bike map - a look into a practical application of graph theorythe bike map - a look into a practical application of graph theory
the bike map - a look into a practical application of graph theory
 
Applications of graphs
Applications of graphsApplications of graphs
Applications of graphs
 
CS6702 graph theory and applications notes pdf book
CS6702 graph theory and applications notes pdf bookCS6702 graph theory and applications notes pdf book
CS6702 graph theory and applications notes pdf book
 
GRAPH COLORING AND ITS APPLICATIONS
GRAPH COLORING AND ITS APPLICATIONSGRAPH COLORING AND ITS APPLICATIONS
GRAPH COLORING AND ITS APPLICATIONS
 
Graph Theory Application - Not Only for Engineering Problems
Graph Theory Application - Not Only for Engineering ProblemsGraph Theory Application - Not Only for Engineering Problems
Graph Theory Application - Not Only for Engineering Problems
 
introduction to graph theory
introduction to graph theoryintroduction to graph theory
introduction to graph theory
 
Application in graph theory
Application in graph theoryApplication in graph theory
Application in graph theory
 
graph theory
graph theory graph theory
graph theory
 
Statistics used in Cricket
Statistics used in Cricket Statistics used in Cricket
Statistics used in Cricket
 
Chromatic graph theory
Chromatic graph theoryChromatic graph theory
Chromatic graph theory
 
Graph
GraphGraph
Graph
 
Introduction to Graph Theory
Introduction to Graph TheoryIntroduction to Graph Theory
Introduction to Graph Theory
 
Graph coloring
Graph coloringGraph coloring
Graph coloring
 
Graph Application in Traffic Control
Graph Application in Traffic ControlGraph Application in Traffic Control
Graph Application in Traffic Control
 
Dmitry Shabanov – Improved algorithms for colorings of simple hypergraphs and...
Dmitry Shabanov – Improved algorithms for colorings of simple hypergraphs and...Dmitry Shabanov – Improved algorithms for colorings of simple hypergraphs and...
Dmitry Shabanov – Improved algorithms for colorings of simple hypergraphs and...
 
Maths with Programming
Maths with ProgrammingMaths with Programming
Maths with Programming
 
Polar equations and_graphs_10.2
Polar equations and_graphs_10.2Polar equations and_graphs_10.2
Polar equations and_graphs_10.2
 

Último

The basics of sentences session 3pptx.pptx
The basics of sentences session 3pptx.pptxThe basics of sentences session 3pptx.pptx
The basics of sentences session 3pptx.pptx
heathfieldcps1
 
Salient Features of India constitution especially power and functions
Salient Features of India constitution especially power and functionsSalient Features of India constitution especially power and functions
Salient Features of India constitution especially power and functions
KarakKing
 
Jual Obat Aborsi Hongkong ( Asli No.1 ) 085657271886 Obat Penggugur Kandungan...
Jual Obat Aborsi Hongkong ( Asli No.1 ) 085657271886 Obat Penggugur Kandungan...Jual Obat Aborsi Hongkong ( Asli No.1 ) 085657271886 Obat Penggugur Kandungan...
Jual Obat Aborsi Hongkong ( Asli No.1 ) 085657271886 Obat Penggugur Kandungan...
ZurliaSoop
 

Último (20)

How to Create and Manage Wizard in Odoo 17
How to Create and Manage Wizard in Odoo 17How to Create and Manage Wizard in Odoo 17
How to Create and Manage Wizard in Odoo 17
 
Basic Civil Engineering first year Notes- Chapter 4 Building.pptx
Basic Civil Engineering first year Notes- Chapter 4 Building.pptxBasic Civil Engineering first year Notes- Chapter 4 Building.pptx
Basic Civil Engineering first year Notes- Chapter 4 Building.pptx
 
Beyond_Borders_Understanding_Anime_and_Manga_Fandom_A_Comprehensive_Audience_...
Beyond_Borders_Understanding_Anime_and_Manga_Fandom_A_Comprehensive_Audience_...Beyond_Borders_Understanding_Anime_and_Manga_Fandom_A_Comprehensive_Audience_...
Beyond_Borders_Understanding_Anime_and_Manga_Fandom_A_Comprehensive_Audience_...
 
HMCS Max Bernays Pre-Deployment Brief (May 2024).pptx
HMCS Max Bernays Pre-Deployment Brief (May 2024).pptxHMCS Max Bernays Pre-Deployment Brief (May 2024).pptx
HMCS Max Bernays Pre-Deployment Brief (May 2024).pptx
 
SOC 101 Demonstration of Learning Presentation
SOC 101 Demonstration of Learning PresentationSOC 101 Demonstration of Learning Presentation
SOC 101 Demonstration of Learning Presentation
 
Unit 3 Emotional Intelligence and Spiritual Intelligence.pdf
Unit 3 Emotional Intelligence and Spiritual Intelligence.pdfUnit 3 Emotional Intelligence and Spiritual Intelligence.pdf
Unit 3 Emotional Intelligence and Spiritual Intelligence.pdf
 
The basics of sentences session 3pptx.pptx
The basics of sentences session 3pptx.pptxThe basics of sentences session 3pptx.pptx
The basics of sentences session 3pptx.pptx
 
Interdisciplinary_Insights_Data_Collection_Methods.pptx
Interdisciplinary_Insights_Data_Collection_Methods.pptxInterdisciplinary_Insights_Data_Collection_Methods.pptx
Interdisciplinary_Insights_Data_Collection_Methods.pptx
 
Fostering Friendships - Enhancing Social Bonds in the Classroom
Fostering Friendships - Enhancing Social Bonds  in the ClassroomFostering Friendships - Enhancing Social Bonds  in the Classroom
Fostering Friendships - Enhancing Social Bonds in the Classroom
 
Python Notes for mca i year students osmania university.docx
Python Notes for mca i year students osmania university.docxPython Notes for mca i year students osmania university.docx
Python Notes for mca i year students osmania university.docx
 
Sociology 101 Demonstration of Learning Exhibit
Sociology 101 Demonstration of Learning ExhibitSociology 101 Demonstration of Learning Exhibit
Sociology 101 Demonstration of Learning Exhibit
 
How to Add New Custom Addons Path in Odoo 17
How to Add New Custom Addons Path in Odoo 17How to Add New Custom Addons Path in Odoo 17
How to Add New Custom Addons Path in Odoo 17
 
Salient Features of India constitution especially power and functions
Salient Features of India constitution especially power and functionsSalient Features of India constitution especially power and functions
Salient Features of India constitution especially power and functions
 
TỔNG ÔN TẬP THI VÀO LỚP 10 MÔN TIẾNG ANH NĂM HỌC 2023 - 2024 CÓ ĐÁP ÁN (NGỮ Â...
TỔNG ÔN TẬP THI VÀO LỚP 10 MÔN TIẾNG ANH NĂM HỌC 2023 - 2024 CÓ ĐÁP ÁN (NGỮ Â...TỔNG ÔN TẬP THI VÀO LỚP 10 MÔN TIẾNG ANH NĂM HỌC 2023 - 2024 CÓ ĐÁP ÁN (NGỮ Â...
TỔNG ÔN TẬP THI VÀO LỚP 10 MÔN TIẾNG ANH NĂM HỌC 2023 - 2024 CÓ ĐÁP ÁN (NGỮ Â...
 
Mehran University Newsletter Vol-X, Issue-I, 2024
Mehran University Newsletter Vol-X, Issue-I, 2024Mehran University Newsletter Vol-X, Issue-I, 2024
Mehran University Newsletter Vol-X, Issue-I, 2024
 
80 ĐỀ THI THỬ TUYỂN SINH TIẾNG ANH VÀO 10 SỞ GD – ĐT THÀNH PHỐ HỒ CHÍ MINH NĂ...
80 ĐỀ THI THỬ TUYỂN SINH TIẾNG ANH VÀO 10 SỞ GD – ĐT THÀNH PHỐ HỒ CHÍ MINH NĂ...80 ĐỀ THI THỬ TUYỂN SINH TIẾNG ANH VÀO 10 SỞ GD – ĐT THÀNH PHỐ HỒ CHÍ MINH NĂ...
80 ĐỀ THI THỬ TUYỂN SINH TIẾNG ANH VÀO 10 SỞ GD – ĐT THÀNH PHỐ HỒ CHÍ MINH NĂ...
 
Jual Obat Aborsi Hongkong ( Asli No.1 ) 085657271886 Obat Penggugur Kandungan...
Jual Obat Aborsi Hongkong ( Asli No.1 ) 085657271886 Obat Penggugur Kandungan...Jual Obat Aborsi Hongkong ( Asli No.1 ) 085657271886 Obat Penggugur Kandungan...
Jual Obat Aborsi Hongkong ( Asli No.1 ) 085657271886 Obat Penggugur Kandungan...
 
This PowerPoint helps students to consider the concept of infinity.
This PowerPoint helps students to consider the concept of infinity.This PowerPoint helps students to consider the concept of infinity.
This PowerPoint helps students to consider the concept of infinity.
 
latest AZ-104 Exam Questions and Answers
latest AZ-104 Exam Questions and Answerslatest AZ-104 Exam Questions and Answers
latest AZ-104 Exam Questions and Answers
 
On_Translating_a_Tamil_Poem_by_A_K_Ramanujan.pptx
On_Translating_a_Tamil_Poem_by_A_K_Ramanujan.pptxOn_Translating_a_Tamil_Poem_by_A_K_Ramanujan.pptx
On_Translating_a_Tamil_Poem_by_A_K_Ramanujan.pptx
 

Football and graph theory

  • 2. INDEX Concepts of Graph theory Facts of Football Graphical representation Constructing graphs using data from semi-finals Predicting Spain’s win-Spain did win!! Reasons for the prediction Degree Centrality Betweenness Centrality Centre Conclusion
  • 3.  Graph: A simple graph G = (V, E) consists of V, a nonempty set of vertices, and E, a set of unordered pairs of distinct elements of V called edges. Here 1,2,3 and 4 are the vertices •a, b, c and d are the edges  Arcs: An edge with a specified direction is called an arc  Path: It is a sequence of edges which connect a sequence of vertices
  • 4.   Directed Graph: A graph having arcs is called a directed graph Directed Network: A directed graph with integer weight attached to each arc is called a directed network.
  • 5. FACTS OF FOOTBALL • A team consists of exactly 1 goalkeeper, 3-5 defenders , 3-5 midfielders and 1-3 strikers • A goalkeeper is a designated player charged with directly preventing the opposing team from scoring by intercepting shots at goal. • A defender is an outfield player whose primary role is to prevent the opposition from attacking. • A mid-fielder plays in the middle of the field and does the job of both defenders and strikers as per the need. • A striker is a player who plays nearest to the opposing team's goal, and is therefore principally responsible for scoring goals
  • 6. Graphical representation of the game. We consider a football match to be analogous to a directed network. • The players of the team are represented as the vertices. • The passes exchanged between players are the arcs, the direction of the arc will be in accordance with the direction of the pass. • We assume that the weight of each arc is one . • We assume that the diagraph will be a connected graph, i.e. every vertex is adjacent to at least one other vertex in the graph. • The network is a tool for visualizing a team’s strategy by fixing its vertices in positions roughly corresponding to the players’ formation on the pitch  0,1,2,3,4,5 and 6 are the players.  Arcs represent the passes between players
  • 7. Constructing the Network World Cup The data for the 2010 FIFA games was downloaded from the official FIFA website The networks were then constructed and analyzed using Wolfram Mathematica As FIFA only provides the aggregate data over all the games, these networks were computed by dividing the number of passes by the total number of games played by each team.
  • 8. The networks for the Netherlands and Spain drawn before the final game, using the data and tactical formations of the semi-finals.
  • 9.
  • 10. I am out of my JOB!!! 
  • 11. The Factors used by us for our Prediction: Degree Centrality Betweeness Centrality Centre of a Graph
  • 12. Degree Centrality . Degree Centrality is the number of arcs incident with a vertex.  This concept can be extended to a player by counting the number of passes he is involved in.
  • 13. N E T H E R L A N D Jersey no. 1 2 3 4 5 6 7 8 9 10 11 15 Jersey No. 1 3 5 S 6 7 P 8 A 11 I 14 N 15 16 18 9 Player Name Stekelenburg Van Der Wiel Heitinga Mathijsen Van bronckhorst Van Bommel Dirk Kuyt Nigel De Jong Robin Van Persie Wesley Sneijder Arjen Robben Braafheid (sub) Player Name Iker Casillas Gerard Pique Carlos Puyol Andreas Iniestaa David Villa Xavi Cap Devila Xabi Alonso Sergio Ramos Sergio Busquets Pedro Fernando Torres (sub) Position Goalkeeper Defender Defender Defender Defender Mid-Fielder Forward Mid-Fielder Forward Mid-Fielder Forward Defender Position Goal-Keeper Defender Defender Mid-Fielder Forward Mid-Fielder Defender Mid-Fielder Defender Mid-Fielder Forward Forward Centrality 48 31 27 33 29 29 11 32 19 35 14 4 Centrality 31 51 54 43 13 95 53 47 54 75 13 2
  • 14.
  • 15. . BETWEENNESS CENTRALITY .  Betweenness centrality quantifies the number of times a vertex acts as a bridge along the shortest path between two other vertices.  Betweenness does not measure how well-connected a player is, but rather how the ball-flow between other players depends on that particular player. It thus provides a measure of the impact of removing that player from the game.
  • 16. Player’s betweenness scores for Spain. Player’s betweenness scores for the Netherlands 0.12 6.17
  • 17. OBSERVATION On the Spanish ,The S betweenness scores are low and uniformly distributed – a sign of a well-balanced passing strategy Concentrated betweenness scores that are on the high side indicate a high dependence on few, too important players, whereas well distributed, low betweenness scores are an indication of a well-balanced passing strategy. The table gives us a good measure of the game-play robustness. By Blocking players with high betweenness centrality the opposing team can interrupt a teams natural flow.
  • 18. Centre Eccentricity of a vertex: It is the maximum distance of that vertex from any other vertex. Graph Radius: It is the minimum distance between any two vertices of the graph. Centre of a graph: Those vertices whose eccentricity equals the graph radius. For a game of football, the centre will be the players whose distance from other players is minimum( here assumed as one) The centre shall appear more in goal scoring attempts.
  • 19. Graphical Analysis for a goal scoring Opportunity: (We define a successful pass as one that was involved in an attack, i.e. the passes that resulted in shots on targets.) Robben  Sneijder  Mapping Of the Dutch Attack.
  • 21. OBSERVATIONS •The Spanish players make extremely large no. of passes during the game as seen by the high network density of their graph, much more than their Dutch counterparts. •The Spanish attack is often unpredictable because of the huge number of passing outlets. •The Dutch attack seems much more traditional with most attacks being carried out by the strikers. •The Spanish attack relies on swift passes between the players, which are evenly distributed among the midfield. •The low no. of arcs in the Dutch team suggests a preference for quick attacks and counter attacks.
  • 22. Using Graph theory to map the football world cup final, we were able to determine the primary reason for Spanish triumph. 1. Spain had a well oiled network of connected players which made for a sound defense, a cohesive midfield and an effective attack. 2. The Dutch lost because their strategy was predictable and easily countered by Spanish who played a clever and an intricate game. 3. They should have considered passing more and involving players other than their attacking mid fielders and strikers in their goal-striking strategy. 4. Similarly, the outcome of the game could have been different had they succeed in blocking the players who belonged to the Spanish center, namely, Xavi, Iniesta and Fabregas. 5. Finally, our observations showed an unbalanced use of the pitch giving a clear preference for the left side by the Dutch.
  • 23. Bibliography  Eclat-volume –III Mathematics Journal  Edgar. G. Goodaire and Micheal M. Parmenter, Discrete Mathematics with graph theory 3rd Edition  http://www.maths.qmul.ac.uk/~ht/footballgraphs/holland Vspain.html  http://plus.maths.org/content/os/latestnews/mayaug10/football/index  www.fifa.com/live/competitions/worldcup/matchday=25/ day=1/math=300061509/index.html
  • 24. Prachi Singhal and Umang Aggarwal Lady Shri Ram College