1. What is graph and how many types?
2. Write down the application of graph
1. A graph is a non-linear data structure, which consists of vertices (or nodes) connected by edges (or arcs) where edges may be directed or undirected.
Types of Graphs:
Though there are a lot of different types of graphs in discrete mathematics, there are some that are extremely common. Some of those are as follows:
1. Null graph: Also called an empty graph, a null graph is a graph in which there are no edges between any of its vertices.
2. Connected graph: A graph in which there is a path of edges between every pair of vertices in the graph. Mary's graph is a connected graph, since there is a way to get from every city on the map to every other city.
3.Disconnected graph: A graph in which the path of edges does not always connect every vertex.
4. Bipartite graph: A graph that can be split into two sets of vertices such that edges only go between sets, not within them.
5. Weighted graph: A graph in which weights, or numerical values, are assigned to each of the edges. Mary's graph is a weighted graph, where the distances between the cities are the weights of the edges.
6.Directed graph: A graph in which the edges are directed by arrows, indicating that the relationship, represented by the edge, only applies from one vertex to the other, but not the other way around. In other words, if a directed edge has an arrow from A to B, A is related to B, but B is not related to A.
7.Undirected graph: A graph whose edges are not directed. Mary's graph is an undirected graph, because the routes between cities go both ways.
8. Simple graph: An undirected graph in which there is at most one edge between each pair of vertices, and there are no loops, which is an edge from a vertex to itself.
9. Multi-graph: A graph in which there are multiple edges between any pair of vertices or there are edges from a vertex to itself, also called a loop.
10. Planar graph: A graph that can be drawn so that all of the edges of the graph do not cross each other.
11. Nonplanar graph: A graph that is not a planar graph. In other words, a graph that cannot be drawn without at least one pair of its edges crossing.
2. Application of Graph;
In Computer science graphs are used to represent the flow of computation.
1.Google maps uses graphs for building transportation systems, where intersection of two(or more) roads are considered to be a vertex and the road connecting two vertices is considered to be an edge, thus their navigation system is based on the algorithm to calculate the shortest path between two vertices.
2. In Facebook, users are considered to be the vertices and if they are friends then there is an edge running between them. Facebook’s Friend suggestion algorithm uses graph theory. Facebook is an example of undirected graph.
3. In World Wide Web, web pages are considered to be the vertices. There is an edge from a page u to other page v if there is a link of page v on page u. This is an example of Directed graph. It was the basic idea behind Google Page Ranking Algorithm.
4. In Operating System, we come across the Resource Allocation Graph where each process and resources are considered to be vertices. Edges are drawn from resources to the allocated process, or from requesting process to the requested resource. If this leads to any formation of a cycle, then a deadlock will occur.
Types of Graphs:
Though there are a lot of different types of graphs in discrete mathematics, there are some that are extremely common. Some of those are as follows:
1. Null graph: Also called an empty graph, a null graph is a graph in which there are no edges between any of its vertices.
2. Connected graph: A graph in which there is a path of edges between every pair of vertices in the graph. Mary's graph is a connected graph, since there is a way to get from every city on the map to every other city.
3.Disconnected graph: A graph in which the path of edges does not always connect every vertex.
4. Bipartite graph: A graph that can be split into two sets of vertices such that edges only go between sets, not within them.
5. Weighted graph: A graph in which weights, or numerical values, are assigned to each of the edges. Mary's graph is a weighted graph, where the distances between the cities are the weights of the edges.
6.Directed graph: A graph in which the edges are directed by arrows, indicating that the relationship, represented by the edge, only applies from one vertex to the other, but not the other way around. In other words, if a directed edge has an arrow from A to B, A is related to B, but B is not related to A.
7.Undirected graph: A graph whose edges are not directed. Mary's graph is an undirected graph, because the routes between cities go both ways.
8. Simple graph: An undirected graph in which there is at most one edge between each pair of vertices, and there are no loops, which is an edge from a vertex to itself.
9. Multi-graph: A graph in which there are multiple edges between any pair of vertices or there are edges from a vertex to itself, also called a loop.
10. Planar graph: A graph that can be drawn so that all of the edges of the graph do not cross each other.
11. Nonplanar graph: A graph that is not a planar graph. In other words, a graph that cannot be drawn without at least one pair of its edges crossing.
2. Application of Graph;
In Computer science graphs are used to represent the flow of computation.
1.Google maps uses graphs for building transportation systems, where intersection of two(or more) roads are considered to be a vertex and the road connecting two vertices is considered to be an edge, thus their navigation system is based on the algorithm to calculate the shortest path between two vertices.
2. In Facebook, users are considered to be the vertices and if they are friends then there is an edge running between them. Facebook’s Friend suggestion algorithm uses graph theory. Facebook is an example of undirected graph.
3. In World Wide Web, web pages are considered to be the vertices. There is an edge from a page u to other page v if there is a link of page v on page u. This is an example of Directed graph. It was the basic idea behind Google Page Ranking Algorithm.
4. In Operating System, we come across the Resource Allocation Graph where each process and resources are considered to be vertices. Edges are drawn from resources to the allocated process, or from requesting process to the requested resource. If this leads to any formation of a cycle, then a deadlock will occur.
1. Answer:
Graph is a non-linear data structure that is same as the mathematical (discrete mathematics) concept of graphs. It is a collection of nodes (also called as vertices) and edges that connect these vertices. Graphs are used to represent arbitrary relationship among objects. A graph can be directed or undirected.
There are several different types of charts and graphs. The four most common are probably line graphs, bar graphs and histograms, pie charts, and Cartesian graphs.
2. Answer:
The application of graph:
1. In Computer science graphs are used to represent the flow of computation.
2. Google maps uses graphs for building transportation systems, where intersection of two(or more) roads are considered to be a vertex and the road connecting two vertices is considered to be an edge, thus their navigation system is based on the algorithm to calculate the shortest path between two vertices.
3. In Facebook, users are considered to be the vertices and if they are friends then there is an edge running between them. Facebook’s Friend suggestion algorithm uses graph theory. Facebook is an example of undirected graph.
4. In World Wide Web, web pages are considered to be the vertices. There is an edge from a page u to other page v if there is a link of page v on page u. This is an example of Directed graph. It was the basic idea behind Google Page Ranking Algorithm.
5. In Operating System, we come across the Resource Allocation Graph where each process and resources are considered to be vertices. Edges are drawn from resources to the allocated process, or from requesting process to the requested resource. If this leads to any formation of a cycle then a deadlock will occur.
Graph is a non-linear data structure that is same as the mathematical (discrete mathematics) concept of graphs. It is a collection of nodes (also called as vertices) and edges that connect these vertices. Graphs are used to represent arbitrary relationship among objects. A graph can be directed or undirected.
There are several different types of charts and graphs. The four most common are probably line graphs, bar graphs and histograms, pie charts, and Cartesian graphs.
2. Answer:
The application of graph:
1. In Computer science graphs are used to represent the flow of computation.
2. Google maps uses graphs for building transportation systems, where intersection of two(or more) roads are considered to be a vertex and the road connecting two vertices is considered to be an edge, thus their navigation system is based on the algorithm to calculate the shortest path between two vertices.
3. In Facebook, users are considered to be the vertices and if they are friends then there is an edge running between them. Facebook’s Friend suggestion algorithm uses graph theory. Facebook is an example of undirected graph.
4. In World Wide Web, web pages are considered to be the vertices. There is an edge from a page u to other page v if there is a link of page v on page u. This is an example of Directed graph. It was the basic idea behind Google Page Ranking Algorithm.
5. In Operating System, we come across the Resource Allocation Graph where each process and resources are considered to be vertices. Edges are drawn from resources to the allocated process, or from requesting process to the requested resource. If this leads to any formation of a cycle then a deadlock will occur.
1. A graph is a non-linear data structure, which consists of vertices (or nodes) connected by edges where edges may be directed or undirected.
Types of Graphs:
Though there are a lot of different types of graphs in discrete mathematics, there are some that are extremely common. Some of those are as follows:
1. Null graph.
2. Connected graph.
3.Disconnected graph.
4. Bipartite graph.
5. Weighted graph.
6.Directed graph.
8. Simple graph.
9. Multi-graph.
2. Application of Graph -
In Computer science graphs are used to represent the flow of computation.
1.Google maps uses graphs for building transportation systems, where intersection of two(or more) roads are considered to be a vertex and the road connecting two vertices is considered to be an edge, thus their navigation system is based on the algorithm to calculate the shortest path between two vertices.
2. In Facebook, users are considered to be the vertices and if they are friends then there is an edge running between them. Facebook’s Friend suggestion algorithm uses graph theory. Facebook is an example of undirected graph.
3. In World Wide Web, web pages are considered to be the vertices. There is an edge from a page u to other page v if there is a link of page v on page u. This is an example of Directed graph. It was the basic idea behind Google Page Ranking Algorithm.
4. In Operating System, we come across the Resource Allocation Graph where each process and resources are considered to be vertices. Edges are drawn from resources to the allocated process, or from requesting process to the requested resource. If this leads to any formation of a cycle, then a deadlock will occur.
Types of Graphs:
Though there are a lot of different types of graphs in discrete mathematics, there are some that are extremely common. Some of those are as follows:
1. Null graph.
2. Connected graph.
3.Disconnected graph.
4. Bipartite graph.
5. Weighted graph.
6.Directed graph.
8. Simple graph.
9. Multi-graph.
2. Application of Graph -
In Computer science graphs are used to represent the flow of computation.
1.Google maps uses graphs for building transportation systems, where intersection of two(or more) roads are considered to be a vertex and the road connecting two vertices is considered to be an edge, thus their navigation system is based on the algorithm to calculate the shortest path between two vertices.
2. In Facebook, users are considered to be the vertices and if they are friends then there is an edge running between them. Facebook’s Friend suggestion algorithm uses graph theory. Facebook is an example of undirected graph.
3. In World Wide Web, web pages are considered to be the vertices. There is an edge from a page u to other page v if there is a link of page v on page u. This is an example of Directed graph. It was the basic idea behind Google Page Ranking Algorithm.
4. In Operating System, we come across the Resource Allocation Graph where each process and resources are considered to be vertices. Edges are drawn from resources to the allocated process, or from requesting process to the requested resource. If this leads to any formation of a cycle, then a deadlock will occur.
Answer to the Q. No - 1
A graph is a non-linear data structure, which consists of vertices (or nodes) connected by edges where edges may be directed or undirected.Types of Graphs:
Though there are a lot of different types of graphs in discrete mathematics, there are some that are extremely common. Some of those are as follows:
- Null graph.
- Connected graph.
- Disconnected graph.
- Bipartite graph.
- Weighted graph.
- Directed graph.
- Simple graph.
- Multi-graph.
Answer to the Q. No - 2
Application of Graph -
In Computer science graphs are used to represent the flow of computation.
- Google maps uses graphs for building transportation systems, where intersection of two(or more) roads are considered to be a vertex and the road connecting two vertices is considered to be an edge, thus their navigation system is based on the algorithm to calculate the shortest path between two vertices.
- In Facebook, users are considered to be the vertices and if they are friends then there is an edge running between them. Facebook’s Friend suggestion algorithm uses graph theory. Facebook is an example of undirected graph.
- In World Wide Web, web pages are considered to be the vertices. There is an edge from a page u to other page v if there is a link of page v on page u. This is an example of Directed graph. It was the basic idea behind Google Page Ranking Algorithm.
- In Operating System, we come across the Resource Allocation Graph where each process and resources are considered to be vertices. Edges are drawn from resources to the allocated process, or from requesting process to the requested resource. If this leads to any formation of a cycle, then a deadlock will occur.
1. A graph is a non-linear data structure, which consists of vertices (or nodes) connected by edges where edges may be directed or undirected.
Types of Graphs:
Though there are a lot of different types of graphs in discrete mathematics, there are some that are extremely common. Some of those are as follows:
1. Null graph.
2. Connected graph.
3.Disconnected graph.
4. Bipartite graph.
5. Weighted graph.
6.Directed graph.
8. Simple graph.
9. Multi-graph.
2. Application of Graph -
In Computer science graphs are used to represent the flow of computation.
1.Google maps uses graphs for building transportation systems, where intersection of two(or more) roads are considered to be a vertex and the road connecting two vertices is considered to be an edge, thus their navigation system is based on the algorithm to calculate the shortest path between two vertices.
Types of Graphs:
Though there are a lot of different types of graphs in discrete mathematics, there are some that are extremely common. Some of those are as follows:
1. Null graph.
2. Connected graph.
3.Disconnected graph.
4. Bipartite graph.
5. Weighted graph.
6.Directed graph.
8. Simple graph.
9. Multi-graph.
2. Application of Graph -
In Computer science graphs are used to represent the flow of computation.
1.Google maps uses graphs for building transportation systems, where intersection of two(or more) roads are considered to be a vertex and the road connecting two vertices is considered to be an edge, thus their navigation system is based on the algorithm to calculate the shortest path between two vertices.
1. A graph is a non-linear data structure, which consists of vertices (or nodes) connected by edges where edges may be directed or undirected.
Types of Graphs:
Though there are a lot of different types of graphs in discrete mathematics, there are some that are extremely common. Some of those are as follows:
1. Null graph.
2. Connected graph.
3.Disconnected graph.
4. Bipartite graph.
5. Weighted graph.
6.Directed graph.
8. Simple graph.
9. Multi-graph.
2. Application of Graph -
In Computer science graphs are used to represent the flow of computation.
1.Google maps uses graphs for building transportation systems, where intersection of two(or more) roads are considered to be a vertex and the road connecting two vertices is considered to be an edge, thus their navigation system is based on the algorithm to calculate the shortest path between two vertices.
2. In Facebook, users are considered to be the vertices and if they are friends then there is an edge running between them. Facebook’s Friend suggestion algorithm uses graph theory. Facebook is an example of undirected graph.
3. In World Wide Web, web pages are considered to be the vertices. There is an edge from a page u to other page v if there is a link of page v on page u. This is an example of Directed graph. It was the basic idea behind Google Page Ranking Algorithm.
4. In Operating System, we come across the Resource Allocation Graph where each process and resources are considered to be vertices. Edges are drawn from resources to the allocated process, or from requesting process to the requested resource. If this leads to any formation of a cycle, then a deadlock will occur.
Types of Graphs:
Though there are a lot of different types of graphs in discrete mathematics, there are some that are extremely common. Some of those are as follows:
1. Null graph.
2. Connected graph.
3.Disconnected graph.
4. Bipartite graph.
5. Weighted graph.
6.Directed graph.
8. Simple graph.
9. Multi-graph.
2. Application of Graph -
In Computer science graphs are used to represent the flow of computation.
1.Google maps uses graphs for building transportation systems, where intersection of two(or more) roads are considered to be a vertex and the road connecting two vertices is considered to be an edge, thus their navigation system is based on the algorithm to calculate the shortest path between two vertices.
2. In Facebook, users are considered to be the vertices and if they are friends then there is an edge running between them. Facebook’s Friend suggestion algorithm uses graph theory. Facebook is an example of undirected graph.
3. In World Wide Web, web pages are considered to be the vertices. There is an edge from a page u to other page v if there is a link of page v on page u. This is an example of Directed graph. It was the basic idea behind Google Page Ranking Algorithm.
4. In Operating System, we come across the Resource Allocation Graph where each process and resources are considered to be vertices. Edges are drawn from resources to the allocated process, or from requesting process to the requested resource. If this leads to any formation of a cycle, then a deadlock will occur.
Types of Graphs:
Though there are a lot of different types of graphs in discrete mathematics, there are some that are extremely common. Some of those are as follows:
1. Null graph.
2. Connected graph.
3.Disconnected graph.
4. Bipartite graph.
5. Weighted graph.
6.Directed graph.
8. Simple graph.
9. Multi-graph.
2. Application of Graph -
In Computer science graphs are used to represent the flow of computation.
1.Google maps uses graphs for building transportation systems, where intersection of two(or more) roads are considered to be a vertex and the road connecting two vertices is considered to be an edge, thus their navigation system is based on the algorithm to calculate the shortest path between two vertices.
Though there are a lot of different types of graphs in discrete mathematics, there are some that are extremely common. Some of those are as follows:
1. Null graph.
2. Connected graph.
3.Disconnected graph.
4. Bipartite graph.
5. Weighted graph.
6.Directed graph.
8. Simple graph.
9. Multi-graph.
2. Application of Graph -
In Computer science graphs are used to represent the flow of computation.
1.Google maps uses graphs for building transportation systems, where intersection of two(or more) roads are considered to be a vertex and the road connecting two vertices is considered to be an edge, thus their navigation system is based on the algorithm to calculate the shortest path between two vertices.
Types of Graphs:
Though there are a lot of different types of graphs in discrete mathematics, there are some that are extremely common. Some of those are as follows:
1. Null graph.
2. Connected graph.
3.Disconnected graph.
4. Bipartite graph.
5. Weighted graph.
6.Directed graph.
8. Simple graph.
9. Multi-graph.
2. Application of Graph -
In Computer science graphs are used to represent the flow of computation.
1.Google maps uses graphs for building transportation systems, where intersection of two(or more) roads are considered to be a vertex and the road connecting two vertices is considered to be an edge, thus their navigation system is based on the algorithm to calculate the shortest path between two vertices.
Though there are a lot of different types of graphs in discrete mathematics, there are some that are extremely common. Some of those are as follows:
1. Null graph.
2. Connected graph.
3.Disconnected graph.
4. Bipartite graph.
5. Weighted graph.
6.Directed graph.
8. Simple graph.
9. Multi-graph.
2. Application of Graph -
In Computer science graphs are used to represent the flow of computation.
1.Google maps uses graphs for building transportation systems, where intersection of two(or more) roads are considered to be a vertex and the road connecting two vertices is considered to be an edge, thus their navigation system is based on the algorithm to calculate the shortest path between two vertices.
Answer to the question no 1:
A Graph is a non-linear data structure consisting of nodes and edges. The nodes are sometimes also referred to as vertices and the edges are lines or arcs that connect any two nodes in the graph. More formally a Graph can be defined as,A Graph consists of a finite set of vertices(or nodes) and set of Edges which connect a pair of nodes.There are a lot of different types of graphs. Some of those are as follows,
1.Bar Graphs.
2.Line Graphs.
3.Combo Graphs.
4. Scatterplot.
5. Waterfall Chart.
6. Pie Graph.
7. Histogram
8. Gauge Graph.
9. Area Graph.
10.Radar Graph.
Answer to the question no 2;
These are the most important graph applications:
1.social networks,
2.web graphs,
3.biological networks,
4.knowledge graphs,
5.product recommendation graphs,
6.neural networks,
7.road networks,
8.blockchains, and
9.bitcoin transaction graphs.
In Computer science graphs are used to represent the flow of computation.
Google maps uses graphs for building transportation systems, where intersection of two(or more) roads are considered to be a vertex and the road connecting two vertices is considered to be an edge, thus their navigation system is based on the algorithm to calculate the shortest path between two vertices.
In Facebook, users are considered to be the vertices and if they are friends then there is an edge running between them. Facebook’s Friend suggestion algorithm uses graph theory. Facebook is an example of undirected graph.
In World Wide Web, web pages are considered to be the vertices. There is an edge from a page u to other page v if there is a link of page v on page u. This is an example of Directed graph. It was the basic idea behind Google Page Ranking Algorithm.
In Operating System, we come across the Resource Allocation Graph where each process and resources are considered to be vertices. Edges are drawn from resources to the allocated process, or from requesting process to the requested resource. If this leads to any formation of a cycle then a deadlock will occur.
Ans to the question no: 1
A graph is a non-linear data structure, which consists of vertices (or nodes) connected by edges where edges may be directed or undirected.
Types of Graphs:
Though there are a lot of different types of graphs in discrete mathematics, there are some that are extremely common. Some of those are as follows:
1. Null graph.
2. Connected graph.
3.Disconnected graph.
4. Bipartite graph.
5. Weighted graph.
6.Directed graph.
8. Simple graph.
9. Multi-graph.
Ans to the question no: 2
Application of Graph -In Computer science graphs are used to represent the flow of computation.
1.Google maps uses graphs for building transportation systems, where intersection of two(or more) roads are considered to be a vertex and the road connecting two vertices is considered to be an edge, thus their navigation system is based on the algorithm to calculate the shortest path between two vertices.
2. In Facebook, users are considered to be the vertices and if they are friends then there is an edge running between them. Facebook’s Friend suggestion algorithm uses graph theory. Facebook is an example of undirected graph.
3. In World Wide Web, web pages are considered to be the vertices. There is an edge from a page u to other page v if there is a link of page v on page u. This is an example of Directed graph. It was the basic idea behind Google Page Ranking Algorithm.
4. In Operating System, we come across the Resource Allocation Graph where each process and resources are considered to be vertices. Edges are drawn from resources to the allocated process, or from requesting process to the requested resource. If this leads to any formation of a cycle, then a deadlock will occur.
A graph is a non-linear data structure, which consists of vertices (or nodes) connected by edges where edges may be directed or undirected.
Types of Graphs:
Though there are a lot of different types of graphs in discrete mathematics, there are some that are extremely common. Some of those are as follows:
1. Null graph.
2. Connected graph.
3.Disconnected graph.
4. Bipartite graph.
5. Weighted graph.
6.Directed graph.
8. Simple graph.
9. Multi-graph.
Ans to the question no: 2
Application of Graph -In Computer science graphs are used to represent the flow of computation.
1.Google maps uses graphs for building transportation systems, where intersection of two(or more) roads are considered to be a vertex and the road connecting two vertices is considered to be an edge, thus their navigation system is based on the algorithm to calculate the shortest path between two vertices.
2. In Facebook, users are considered to be the vertices and if they are friends then there is an edge running between them. Facebook’s Friend suggestion algorithm uses graph theory. Facebook is an example of undirected graph.
3. In World Wide Web, web pages are considered to be the vertices. There is an edge from a page u to other page v if there is a link of page v on page u. This is an example of Directed graph. It was the basic idea behind Google Page Ranking Algorithm.
4. In Operating System, we come across the Resource Allocation Graph where each process and resources are considered to be vertices. Edges are drawn from resources to the allocated process, or from requesting process to the requested resource. If this leads to any formation of a cycle, then a deadlock will occur.
1. A graph is a non-linear data structure, which consists of vertices (or nodes) connected by edges where edges may be directed or undirected.
Types of Graphs:
Though there are a lot of different types of graphs in discrete mathematics, there are some that are extremely common. Some of those are as follows:
1. Null graph.
2. Connected graph.
3.Disconnected graph.
4. Bipartite graph.
5. Weighted graph.
6.Directed graph.
8. Simple graph.
9. Multi-graph.
2. Application of Graph;
In Computer science graphs are used to represent the flow of computation.
1.Google maps uses graphs for building transportation systems, where intersection of two(or more) roads are considered to be a vertex and the road connecting two vertices is considered to be an edge, thus their navigation system is based on the algorithm to calculate the shortest path between two vertices.
2. In Facebook, users are considered to be the vertices and if they are friends then there is an edge running between them. Facebook’s Friend suggestion algorithm uses graph theory. Facebook is an example of undirected graph.
3. In World Wide Web, web pages are considered to be the vertices. There is an edge from a page u to other page v if there is a link of page v on page u. This is an example of Directed graph. It was the basic idea behind Google Page Ranking Algorithm.
4. In Operating System, we come across the Resource Allocation Graph where each process and resources are considered to be vertices. Edges are drawn from resources to the allocated process, or from requesting process to the requested resource. If this leads to any formation of a cycle, then a deadlock will occur.
Types of Graphs:
Though there are a lot of different types of graphs in discrete mathematics, there are some that are extremely common. Some of those are as follows:
1. Null graph.
2. Connected graph.
3.Disconnected graph.
4. Bipartite graph.
5. Weighted graph.
6.Directed graph.
8. Simple graph.
9. Multi-graph.
2. Application of Graph;
In Computer science graphs are used to represent the flow of computation.
1.Google maps uses graphs for building transportation systems, where intersection of two(or more) roads are considered to be a vertex and the road connecting two vertices is considered to be an edge, thus their navigation system is based on the algorithm to calculate the shortest path between two vertices.
2. In Facebook, users are considered to be the vertices and if they are friends then there is an edge running between them. Facebook’s Friend suggestion algorithm uses graph theory. Facebook is an example of undirected graph.
3. In World Wide Web, web pages are considered to be the vertices. There is an edge from a page u to other page v if there is a link of page v on page u. This is an example of Directed graph. It was the basic idea behind Google Page Ranking Algorithm.
4. In Operating System, we come across the Resource Allocation Graph where each process and resources are considered to be vertices. Edges are drawn from resources to the allocated process, or from requesting process to the requested resource. If this leads to any formation of a cycle, then a deadlock will occur.
1. A graph is a non-linear data structure, which consists of vertices (or nodes) connected by edges (or arcs) where edges may be directed or undirected.
Types of Graphs:
Though there are a lot of different types of graphs in discrete mathematics, there are some that are extremely common. Some of those are as follows:
1. Null graph: Also called an empty graph, a null graph is a graph in which there are no edges between any of its vertices.
2. Connected graph: A graph in which there is a path of edges between every pair of vertices in the graph. Mary's graph is a connected graph, since there is a way to get from every city on the map to every other city.
3.Disconnected graph: A graph in which the path of edges does not always connect every vertex.
4. Bipartite graph: A graph that can be split into two sets of vertices such that edges only go between sets, not within them.
5. Weighted graph: A graph in which weights, or numerical values, are assigned to each of the edges. Mary's graph is a weighted graph, where the distances between the cities are the weights of the edges.
6.Directed graph: A graph in which the edges are directed by arrows, indicating that the relationship, represented by the edge, only applies from one vertex to the other, but not the other way around. In other words, if a directed edge has an arrow from A to B, A is related to B, but B is not related to A.
7.Undirected graph: A graph whose edges are not directed. Mary's graph is an undirected graph, because the routes between cities go both ways.
8. Simple graph: An undirected graph in which there is at most one edge between each pair of vertices, and there are no loops, which is an edge from a vertex to itself.
9. Multi-graph: A graph in which there are multiple edges between any pair of vertices or there are edges from a vertex to itself, also called a loop.
10. Planar graph: A graph that can be drawn so that all of the edges of the graph do not cross each other.
11. Nonplanar graph: A graph that is not a planar graph. In other words, a graph that cannot be drawn without at least one pair of its edges crossing.
2. Application of Graph;
In Computer science graphs are used to represent the flow of computation.
1.Google maps uses graphs for building transportation systems, where intersection of two(or more) roads are considered to be a vertex and the road connecting two vertices is considered to be an edge, thus their navigation system is based on the algorithm to calculate the shortest path between two vertices.
2. In Facebook, users are considered to be the vertices and if they are friends then there is an edge running between them. Facebook’s Friend suggestion algorithm uses graph theory. Facebook is an example of undirected graph.
3. In World Wide Web, web pages are considered to be the vertices. There is an edge from a page u to other page v if there is a link of page v on page u. This is an example of Directed graph. It was the basic idea behind Google Page Ranking Algorithm.
4. In Operating System, we come across the Resource Allocation Graph where each process and resources are considered to be vertices. Edges are drawn from resources to the allocated process, or from requesting process to the requested resource. If this leads to any formation of a cycle, then a deadlock will occur.
Types of Graphs:
Though there are a lot of different types of graphs in discrete mathematics, there are some that are extremely common. Some of those are as follows:
1. Null graph: Also called an empty graph, a null graph is a graph in which there are no edges between any of its vertices.
2. Connected graph: A graph in which there is a path of edges between every pair of vertices in the graph. Mary's graph is a connected graph, since there is a way to get from every city on the map to every other city.
3.Disconnected graph: A graph in which the path of edges does not always connect every vertex.
4. Bipartite graph: A graph that can be split into two sets of vertices such that edges only go between sets, not within them.
5. Weighted graph: A graph in which weights, or numerical values, are assigned to each of the edges. Mary's graph is a weighted graph, where the distances between the cities are the weights of the edges.
6.Directed graph: A graph in which the edges are directed by arrows, indicating that the relationship, represented by the edge, only applies from one vertex to the other, but not the other way around. In other words, if a directed edge has an arrow from A to B, A is related to B, but B is not related to A.
7.Undirected graph: A graph whose edges are not directed. Mary's graph is an undirected graph, because the routes between cities go both ways.
8. Simple graph: An undirected graph in which there is at most one edge between each pair of vertices, and there are no loops, which is an edge from a vertex to itself.
9. Multi-graph: A graph in which there are multiple edges between any pair of vertices or there are edges from a vertex to itself, also called a loop.
10. Planar graph: A graph that can be drawn so that all of the edges of the graph do not cross each other.
11. Nonplanar graph: A graph that is not a planar graph. In other words, a graph that cannot be drawn without at least one pair of its edges crossing.
2. Application of Graph;
In Computer science graphs are used to represent the flow of computation.
1.Google maps uses graphs for building transportation systems, where intersection of two(or more) roads are considered to be a vertex and the road connecting two vertices is considered to be an edge, thus their navigation system is based on the algorithm to calculate the shortest path between two vertices.
2. In Facebook, users are considered to be the vertices and if they are friends then there is an edge running between them. Facebook’s Friend suggestion algorithm uses graph theory. Facebook is an example of undirected graph.
3. In World Wide Web, web pages are considered to be the vertices. There is an edge from a page u to other page v if there is a link of page v on page u. This is an example of Directed graph. It was the basic idea behind Google Page Ranking Algorithm.
4. In Operating System, we come across the Resource Allocation Graph where each process and resources are considered to be vertices. Edges are drawn from resources to the allocated process, or from requesting process to the requested resource. If this leads to any formation of a cycle, then a deadlock will occur.
1. Answer:
A graph is a non-linear data structure that is the same as the mathematical (discrete mathematics) concept of graphs. It is a collection of nodes (also called vertices) and edges that connect these vertices. Graphs are used to represent the arbitrary relationship among objects. A graph can be directed or undirected.
There are several different types of charts and graphs. The four most common are probably line graphs, bar graphs and histograms, pie charts, and Cartesian graphs.
2. Answer:
The application of graph:
1. In Computer science graphs are used to represent the flow of computation.
2. Google maps uses graphs for building transportation systems, where the intersection of two(or more) roads are considered to be a vertex and the road connecting two vertices is considered to be an edge, thus their navigation system is based on the algorithm to calculate the shortest path between two vertices.
3. In Facebook, users are considered to be the vertices and if they are friends then there is an edge running between them. Facebook’s Friend suggestion algorithm uses graph theory. Facebook is an example of an undirected graph.
4. In the World Wide Web, web pages are considered to be vertices. There is an edge from page u to page v if there is a link to page v on page u. This is an example of a Directed graph. It was the basic idea behind Google Page Ranking Algorithm.
5. In Operating System, we come across the Resource Allocation Graph where each process and resource is considered to be vertices. Edges are drawn from resources to the allocated process, or from the requesting process to the requested resource. If this leads to any formation of a cycle then a deadlock will occur.
A graph is a non-linear data structure that is the same as the mathematical (discrete mathematics) concept of graphs. It is a collection of nodes (also called vertices) and edges that connect these vertices. Graphs are used to represent the arbitrary relationship among objects. A graph can be directed or undirected.
There are several different types of charts and graphs. The four most common are probably line graphs, bar graphs and histograms, pie charts, and Cartesian graphs.
2. Answer:
The application of graph:
1. In Computer science graphs are used to represent the flow of computation.
2. Google maps uses graphs for building transportation systems, where the intersection of two(or more) roads are considered to be a vertex and the road connecting two vertices is considered to be an edge, thus their navigation system is based on the algorithm to calculate the shortest path between two vertices.
3. In Facebook, users are considered to be the vertices and if they are friends then there is an edge running between them. Facebook’s Friend suggestion algorithm uses graph theory. Facebook is an example of an undirected graph.
4. In the World Wide Web, web pages are considered to be vertices. There is an edge from page u to page v if there is a link to page v on page u. This is an example of a Directed graph. It was the basic idea behind Google Page Ranking Algorithm.
5. In Operating System, we come across the Resource Allocation Graph where each process and resource is considered to be vertices. Edges are drawn from resources to the allocated process, or from the requesting process to the requested resource. If this leads to any formation of a cycle then a deadlock will occur.
Answer to the Q. No - 1
A graph is a non-linear data structure, which consists of vertices (or nodes) connected by edges where edges may be directed or undirected.
Types of Graphs:
Though there are a lot of different types of graphs in discrete mathematics, there are some that are extremely common. Some of those are as follows:
Null graph.
Connected graph.
Disconnected graph.
Bipartite graph.
Weighted graph.
Directed graph.
Simple graph.
Multi-graph.
Answer to the Q. No - 2
Application of Graph -In Computer science graphs are used to represent the flow of computation.
1.Google maps uses graphs for building transportation systems, where intersection of two(or more) roads are considered to be a vertex and the road connecting two vertices is considered to be an edge, thus their navigation system is based on the algorithm to calculate the shortest path between two vertices.
2. In Facebook, users are considered to be the vertices and if they are friends then there is an edge running between them. Facebook’s Friend suggestion algorithm uses graph theory. Facebook is an example of undirected graph.
A graph is a non-linear data structure, which consists of vertices (or nodes) connected by edges where edges may be directed or undirected.
Types of Graphs:
Though there are a lot of different types of graphs in discrete mathematics, there are some that are extremely common. Some of those are as follows:
Null graph.
Connected graph.
Disconnected graph.
Bipartite graph.
Weighted graph.
Directed graph.
Simple graph.
Multi-graph.
Answer to the Q. No - 2
Application of Graph -In Computer science graphs are used to represent the flow of computation.
1.Google maps uses graphs for building transportation systems, where intersection of two(or more) roads are considered to be a vertex and the road connecting two vertices is considered to be an edge, thus their navigation system is based on the algorithm to calculate the shortest path between two vertices.
2. In Facebook, users are considered to be the vertices and if they are friends then there is an edge running between them. Facebook’s Friend suggestion algorithm uses graph theory. Facebook is an example of undirected graph.
Answer to the Q. No - 1
A graph is a non-linear data structure, which consists of vertices (or nodes) connected by edges where edges may be directed or undirected.
Types of Graphs:
Though there are a lot of different types of graphs in discrete mathematics, there are some that are extremely common. Some of those are as follows:
Null graph.
Connected graph.
Disconnected graph.
Bipartite graph.
Weighted graph.
Directed graph.
Simple graph.
Multi-graph.
Answer to the Q. No - 2
Application of Graph -In Computer science graphs are used to represent the flow of computation.
1.Google maps uses graphs for building transportation systems, where intersection of two(or more) roads are considered to be a vertex and the road connecting two vertices is considered to be an edge, thus their navigation system is based on the algorithm to calculate the shortest path between two vertices.
2. In Facebook, users are considered to be the vertices and if they are friends then there is an edge running between them. Facebook’s Friend suggestion algorithm uses graph theory. Facebook is an example of undirected graph.
A graph is a non-linear data structure, which consists of vertices (or nodes) connected by edges where edges may be directed or undirected.
Types of Graphs:
Though there are a lot of different types of graphs in discrete mathematics, there are some that are extremely common. Some of those are as follows:
Null graph.
Connected graph.
Disconnected graph.
Bipartite graph.
Weighted graph.
Directed graph.
Simple graph.
Multi-graph.
Answer to the Q. No - 2
Application of Graph -In Computer science graphs are used to represent the flow of computation.
1.Google maps uses graphs for building transportation systems, where intersection of two(or more) roads are considered to be a vertex and the road connecting two vertices is considered to be an edge, thus their navigation system is based on the algorithm to calculate the shortest path between two vertices.
2. In Facebook, users are considered to be the vertices and if they are friends then there is an edge running between them. Facebook’s Friend suggestion algorithm uses graph theory. Facebook is an example of undirected graph.
Answer to the Question no 1.
A graph is a non-linear data structure, which consists of vertices (or nodes) connected by edges (or arcs) where edges may be directed or undirected.
Types of Graphs:
Though there are a lot of different types of graphs in discrete mathematics, there are some that are extremely common. Some of those are as follows:
1. Null graph: Also called an empty graph, a null graph is a graph in which there are no edges between any of its vertices.
2. Connected graph: A graph in which there is a path of edges between every pair of vertices in the graph. Mary's graph is a connected graph, since there is a way to get from every city on the map to every other city.
3.Disconnected graph: A graph in which the path of edges does not always connect every vertex.
4. Bipartite graph: A graph that can be split into two sets of vertices such that edges only go between sets, not within them.
5. Weighted graph: A graph in which weights, or numerical values, are assigned to each of the edges. Mary's graph is a weighted graph, where the distances between the cities are the weights of the edges.
6.Directed graph: A graph in which the edges are directed by arrows, indicating that the relationship, represented by the edge, only applies from one vertex to the other, but not the other way around. In other words, if a directed edge has an arrow from A to B, A is related to B, but B is not related to A.
7.Undirected graph: A graph whose edges are not directed. Mary's graph is an undirected graph, because the routes between cities go both ways.
8. Simple graph: An undirected graph in which there is at most one edge between each pair of vertices, and there are no loops, which is an edge from a vertex to itself.
9. Multi-graph: A graph in which there are multiple edges between any pair of vertices or there are edges from a vertex to itself, also called a loop.
10. Planar graph: A graph that can be drawn so that all of the edges of the graph do not cross each other.
11. Nonplanar graph: A graph that is not a planar graph. In other words, a graph that cannot be drawn without at least one pair of its edges crossing.
Answer to the Question no 2.
Application of Graph;
In Computer science graphs are used to represent the flow of computation.
1.Google maps uses graphs for building transportation systems, where intersection of two(or more) roads are considered to be a vertex and the road connecting two vertices is considered to be an edge, thus their navigation system is based on the algorithm to calculate the shortest path between two vertices.
2. In Facebook, users are considered to be the vertices and if they are friends then there is an edge running between them. Facebook’s Friend suggestion algorithm uses graph theory. Facebook is an example of undirected graph.
3. In World Wide Web, web pages are considered to be the vertices. There is an edge from a page u to other page v if there is a link of page v on page u. This is an example of Directed graph. It was the basic idea behind Google Page Ranking Algorithm.
4. In Operating System, we come across the Resource Allocation Graph where each process and resources are considered to be vertices. Edges are drawn from resources to the allocated process, or from requesting process to the requested resource. If this leads to any formation of a cycle, then a deadlock will occur.
A graph is a non-linear data structure, which consists of vertices (or nodes) connected by edges (or arcs) where edges may be directed or undirected.
Types of Graphs:
Though there are a lot of different types of graphs in discrete mathematics, there are some that are extremely common. Some of those are as follows:
1. Null graph: Also called an empty graph, a null graph is a graph in which there are no edges between any of its vertices.
2. Connected graph: A graph in which there is a path of edges between every pair of vertices in the graph. Mary's graph is a connected graph, since there is a way to get from every city on the map to every other city.
3.Disconnected graph: A graph in which the path of edges does not always connect every vertex.
4. Bipartite graph: A graph that can be split into two sets of vertices such that edges only go between sets, not within them.
5. Weighted graph: A graph in which weights, or numerical values, are assigned to each of the edges. Mary's graph is a weighted graph, where the distances between the cities are the weights of the edges.
6.Directed graph: A graph in which the edges are directed by arrows, indicating that the relationship, represented by the edge, only applies from one vertex to the other, but not the other way around. In other words, if a directed edge has an arrow from A to B, A is related to B, but B is not related to A.
7.Undirected graph: A graph whose edges are not directed. Mary's graph is an undirected graph, because the routes between cities go both ways.
8. Simple graph: An undirected graph in which there is at most one edge between each pair of vertices, and there are no loops, which is an edge from a vertex to itself.
9. Multi-graph: A graph in which there are multiple edges between any pair of vertices or there are edges from a vertex to itself, also called a loop.
10. Planar graph: A graph that can be drawn so that all of the edges of the graph do not cross each other.
11. Nonplanar graph: A graph that is not a planar graph. In other words, a graph that cannot be drawn without at least one pair of its edges crossing.
Answer to the Question no 2.
Application of Graph;
In Computer science graphs are used to represent the flow of computation.
1.Google maps uses graphs for building transportation systems, where intersection of two(or more) roads are considered to be a vertex and the road connecting two vertices is considered to be an edge, thus their navigation system is based on the algorithm to calculate the shortest path between two vertices.
2. In Facebook, users are considered to be the vertices and if they are friends then there is an edge running between them. Facebook’s Friend suggestion algorithm uses graph theory. Facebook is an example of undirected graph.
3. In World Wide Web, web pages are considered to be the vertices. There is an edge from a page u to other page v if there is a link of page v on page u. This is an example of Directed graph. It was the basic idea behind Google Page Ranking Algorithm.
4. In Operating System, we come across the Resource Allocation Graph where each process and resources are considered to be vertices. Edges are drawn from resources to the allocated process, or from requesting process to the requested resource. If this leads to any formation of a cycle, then a deadlock will occur.
1. Answer:
Graph is a non-linear data structure that is same as the mathematical (discrete mathematics) concept of graphs. It is a collection of nodes (also called as vertices) and edges that connect these vertices. Graphs are used to represent arbitrary relationship among objects. A graph can be directed or undirected.
There are several different types of charts and graphs. The four most common are probably line graphs, bar graphs and histograms, pie charts, and Cartesian graphs.
2. Answer:
The application of graph:
1. In Computer science graphs are used to represent the flow of computation.
2. Google maps uses graphs for building transportation systems, where intersection of two(or more) roads are considered to be a vertex and the road connecting two vertices is considered to be an edge, thus their navigation system is based on the algorithm to calculate the shortest path between two vertices.
3. In Facebook, users are considered to be the vertices and if they are friends then there is an edge running between them. Facebook’s Friend suggestion algorithm uses graph theory. Facebook is an example of undirected graph.
4. In World Wide Web, web pages are considered to be the vertices. There is an edge from a page u to other page v if there is a link of page v on page u. This is an example of Directed graph. It was the basic idea behind Google Page Ranking Algorithm.
5. In Operating System, we come across the Resource Allocation Graph where each process and resources are considered to be vertices. Edges are drawn from resources to the allocated process, or from requesting process to the requested resource. If this leads to any formation of a cycle then a deadlock will occur.
Graph is a non-linear data structure that is same as the mathematical (discrete mathematics) concept of graphs. It is a collection of nodes (also called as vertices) and edges that connect these vertices. Graphs are used to represent arbitrary relationship among objects. A graph can be directed or undirected.
There are several different types of charts and graphs. The four most common are probably line graphs, bar graphs and histograms, pie charts, and Cartesian graphs.
2. Answer:
The application of graph:
1. In Computer science graphs are used to represent the flow of computation.
2. Google maps uses graphs for building transportation systems, where intersection of two(or more) roads are considered to be a vertex and the road connecting two vertices is considered to be an edge, thus their navigation system is based on the algorithm to calculate the shortest path between two vertices.
3. In Facebook, users are considered to be the vertices and if they are friends then there is an edge running between them. Facebook’s Friend suggestion algorithm uses graph theory. Facebook is an example of undirected graph.
4. In World Wide Web, web pages are considered to be the vertices. There is an edge from a page u to other page v if there is a link of page v on page u. This is an example of Directed graph. It was the basic idea behind Google Page Ranking Algorithm.
5. In Operating System, we come across the Resource Allocation Graph where each process and resources are considered to be vertices. Edges are drawn from resources to the allocated process, or from requesting process to the requested resource. If this leads to any formation of a cycle then a deadlock will occur.
1. A graph is a non-linear data structure, which consists of vertices (or nodes) connected by edges (or arcs) where edges may be directed or undirected.
Types of Graphs:
Though there are a lot of different types of graphs in discrete mathematics, there are some that are extremely common. Some of those are as follows:
1. Null graph: Also called an empty graph, a null graph is a graph in which there are no edges between any of its vertices.
2. Connected graph: A graph in which there is a path of edges between every pair of vertices in the graph. Mary's graph is a connected graph, since there is a way to get from every city on the map to every other city.
3.Disconnected graph: A graph in which the path of edges does not always connect every vertex.
4. Bipartite graph: A graph that can be split into two sets of vertices such that edges only go between sets, not within them.
5. Weighted graph: A graph in which weights, or numerical values, are assigned to each of the edges. Mary's graph is a weighted graph, where the distances between the cities are the weights of the edges.
6.Directed graph: A graph in which the edges are directed by arrows, indicating that the relationship, represented by the edge, only applies from one vertex to the other, but not the other way around. In other words, if a directed edge has an arrow from A to B, A is related to B, but B is not related to A.
7.Undirected graph: A graph whose edges are not directed. Mary's graph is an undirected graph, because the routes between cities go both ways.
8. Simple graph: An undirected graph in which there is at most one edge between each pair of vertices, and there are no loops, which is an edge from a vertex to itself.
9. Multi-graph: A graph in which there are multiple edges between any pair of vertices or there are edges from a vertex to itself, also called a loop.
10. Planar graph: A graph that can be drawn so that all of the edges of the graph do not cross each other.
11. Nonplanar graph: A graph that is not a planar graph. In other words, a graph that cannot be drawn without at least one pair of its edges crossing.
2. Application of Graph;
In Computer science graphs are used to represent the flow of computation.
1.Google maps uses graphs for building transportation systems, where intersection of two(or more) roads are considered to be a vertex and the road connecting two vertices is considered to be an edge, thus their navigation system is based on the algorithm to calculate the shortest path between two vertices.
2. In Facebook, users are considered to be the vertices and if they are friends then there is an edge running between them. Facebook’s Friend suggestion algorithm uses graph theory. Facebook is an example of undirected graph.
3. In World Wide Web, web pages are considered to be the vertices. There is an edge from a page u to other page v if there is a link of page v on page u. This is an example of Directed graph. It was the basic idea behind Google Page Ranking Algorithm.
4. In Operating System, we come across the Resource Allocation Graph where each process and resources are considered to be vertices. Edges are drawn from resources to the allocated process, or from requesting process to the requested resource. If this leads to any formation of a cycle, then a deadlock will occur.
1.
Graph is a non-linear data structure that is same as the mathematical (discrete mathematics) concept of graphs. It is a collection of nodes (also called as vertices) and edges that connect these vertices. Graphs are used to represent arbitrary relationship among objects. A graph can be directed or undirected.
There are several different types of charts and graphs. The four most common are probably line graphs, bar graphs and histograms, pie charts, and Cartesian graphs.
2.
Application of Graph -
In Computer science graphs are used to represent the flow of computation.
1.Google maps uses graphs for building transportation systems, where intersection of two(or more) roads are considered to be a vertex and the road connecting two vertices is considered to be an edge, thus their navigation system is based on the algorithm to calculate the shortest path between two vertices.
2. In Facebook, users are considered to be the vertices and if they are friends then there is an edge running between them. Facebook’s Friend suggestion algorithm uses graph theory. Facebook is an example of undirected graph.
3. In World Wide Web, web pages are considered to be the vertices. There is an edge from a page u to other page v if there is a link of page v on page u. This is an example of Directed graph. It was the basic idea behind Google Page Ranking Algorithm.
4. In Operating System, we come across the Resource Allocation Graph where each process and resources are considered to be vertices. Edges are drawn from resources to the allocated process, or from requesting process to the requested resource. If this leads to any formation of a cycle, then a deadlock will occur.
Graph is a non-linear data structure that is same as the mathematical (discrete mathematics) concept of graphs. It is a collection of nodes (also called as vertices) and edges that connect these vertices. Graphs are used to represent arbitrary relationship among objects. A graph can be directed or undirected.
There are several different types of charts and graphs. The four most common are probably line graphs, bar graphs and histograms, pie charts, and Cartesian graphs.
2.
Application of Graph -
In Computer science graphs are used to represent the flow of computation.
1.Google maps uses graphs for building transportation systems, where intersection of two(or more) roads are considered to be a vertex and the road connecting two vertices is considered to be an edge, thus their navigation system is based on the algorithm to calculate the shortest path between two vertices.
2. In Facebook, users are considered to be the vertices and if they are friends then there is an edge running between them. Facebook’s Friend suggestion algorithm uses graph theory. Facebook is an example of undirected graph.
3. In World Wide Web, web pages are considered to be the vertices. There is an edge from a page u to other page v if there is a link of page v on page u. This is an example of Directed graph. It was the basic idea behind Google Page Ranking Algorithm.
4. In Operating System, we come across the Resource Allocation Graph where each process and resources are considered to be vertices. Edges are drawn from resources to the allocated process, or from requesting process to the requested resource. If this leads to any formation of a cycle, then a deadlock will occur.
Answer to the question no 1:
Graphs are a common method to visually illustrate relationships in the data. The purpose of a graph is to present data that are too numerous or complicated to be described adequately in the text and in less space.There are many types of graph.Such as,
1.Scatter plot
2.Area graph
3.Histogram
4.Pictograph
5.Bar graph
6.Line graph
Answer to the question no 2:
Application of graph in real life,
Facebook: Each user is represented as a vertex and two people are friends when there is an edge between two vertices. Similarly friend suggestion also uses graph theory concept.
Google Maps: Various locations are represented as vertices and the roads are represented as edges and graph theory is used to find shortest path between two nodes.
Recommendations on e-commerce websites: The “Recommendations for you” section on various e-commerce websites uses graph theory to recommend items of similar type to user’s choice.
Graph theory is also used to study molecules in chemistry and physics.
Graphs are a common method to visually illustrate relationships in the data. The purpose of a graph is to present data that are too numerous or complicated to be described adequately in the text and in less space.There are many types of graph.Such as,
1.Scatter plot
2.Area graph
3.Histogram
4.Pictograph
5.Bar graph
6.Line graph
Answer to the question no 2:
Application of graph in real life,
Facebook: Each user is represented as a vertex and two people are friends when there is an edge between two vertices. Similarly friend suggestion also uses graph theory concept.
Google Maps: Various locations are represented as vertices and the roads are represented as edges and graph theory is used to find shortest path between two nodes.
Recommendations on e-commerce websites: The “Recommendations for you” section on various e-commerce websites uses graph theory to recommend items of similar type to user’s choice.
Graph theory is also used to study molecules in chemistry and physics.
Answer to the Q. No - 1
A graph is a non-linear data structure, which consists of vertices (or nodes) connected by edges where edges may be directed or undirected.
Types of Graphs:
Though there are a lot of different types of graphs in discrete mathematics, there are some that are extremely common. Some of those are as follows:
Null graph.
Connected graph.
Disconnected graph.
Bipartite graph.
Weighted graph.
Directed graph.
Simple graph.
Multi-graph.
Answer to the Q. No - 2
Application of Graph -
In Computer science graphs are used to represent the flow of computation.
Google maps uses graphs for building transportation systems, where intersection of two(or more) roads are considered to be a vertex and the road connecting two vertices is considered to be an edge, thus their navigation system is based on the algorithm to calculate the shortest path between two vertices.
In Facebook, users are considered to be the vertices and if they are friends then there is an edge running between them. Facebook’s Friend suggestion algorithm uses graph theory. Facebook is an example of undirected graph.
In World Wide Web, web pages are considered to be the vertices. There is an edge from a page u to other page v if there is a link of page v on page u. This is an example of Directed graph. It was the basic idea behind Google Page Ranking Algorithm.
In Operating System, we come across the Resource Allocation Graph where each process and resources are considered to be vertices. Edges are drawn from resources to the allocated process, or from requesting process to the requested resource. If this leads to any formation of a cycle, then a deadlock will occur.
Answer to the question no1
Graph is a non-linear data structure that is same as the mathematical (discrete mathematics) concept of graphs. It is a collection of nodes (also called as vertices) and edges that connect these vertices. Graphs are used to represent arbitrary relationship among objects. A graph can be directed or undirected.
There are several different types of charts and graphs. The four most common are probably line graphs, bar graphs and histograms, pie charts, and Cartesian graphs.
Answer to the question no.2
The application of graph:
1. In Computer science graphs are used to represent the flow of computation.
2. Google maps uses graphs for building transportation systems, where intersection of two(or more) roads are considered to be a vertex and the road connecting two vertices is considered to be an edge, thus their navigation system is based on the algorithm to calculate the shortest path between two vertices.
3. In Facebook, users are considered to be the vertices and if they are friends then there is an edge running between them. Facebook’s Friend suggestion algorithm uses graph theory. Facebook is an example of undirected graph.
4. In World Wide Web, web pages are considered to be the vertices. There is an edge from a page u to other page v if there is a link of page v on page u. This is an example of Directed graph. It was the basic idea behind Google Page Ranking Algorithm.
5. In Operating System, we come across the Resource Allocation Graph where each process and resources are considered to be vertices. Edges are drawn from resources to the allocated process, or from requesting process to the requested resource. If this leads to any formation of a cycle then a deadlock will occur.
1. Answer:
Graph is a non-linear data structure that is same as the mathematical (discrete mathematics) concept of graphs. It is a collection of nodes (also called as vertices) and edges that connect these vertices. Graphs are used to represent arbitrary relationship among objects. A graph can be directed or undirected.
There are several different types of charts and graphs. The four most common are probably line graphs, bar graphs and histograms, pie charts, and Cartesian graphs.
2. Answer:
The application of graph:
1. In Computer science graphs are used to represent the flow of computation.
2. Google maps uses graphs for building transportation systems, where intersection of two(or more) roads are considered to be a vertex and the road connecting two vertices is considered to be an edge, thus their navigation system is based on the algorithm to calculate the shortest path between two vertices.
3. In Facebook, users are considered to be the vertices and if they are friends then there is an edge running between them. Facebook’s Friend suggestion algorithm uses graph theory. Facebook is an example of undirected graph.
4. In World Wide Web, web pages are considered to be the vertices. There is an edge from a page u to other page v if there is a link of page v on page u. This is an example of Directed graph. It was the basic idea behind Google Page Ranking Algorithm.
5. In Operating System, we come across the Resource Allocation Graph where each process and resources are considered to be vertices. Edges are drawn from resources to the allocated process, or from requesting process to the requested resource. If this leads to any formation of a cycle then a deadlock will occur.
Graph is a non-linear data structure that is same as the mathematical (discrete mathematics) concept of graphs. It is a collection of nodes (also called as vertices) and edges that connect these vertices. Graphs are used to represent arbitrary relationship among objects. A graph can be directed or undirected.
There are several different types of charts and graphs. The four most common are probably line graphs, bar graphs and histograms, pie charts, and Cartesian graphs.
2. Answer:
The application of graph:
1. In Computer science graphs are used to represent the flow of computation.
2. Google maps uses graphs for building transportation systems, where intersection of two(or more) roads are considered to be a vertex and the road connecting two vertices is considered to be an edge, thus their navigation system is based on the algorithm to calculate the shortest path between two vertices.
3. In Facebook, users are considered to be the vertices and if they are friends then there is an edge running between them. Facebook’s Friend suggestion algorithm uses graph theory. Facebook is an example of undirected graph.
4. In World Wide Web, web pages are considered to be the vertices. There is an edge from a page u to other page v if there is a link of page v on page u. This is an example of Directed graph. It was the basic idea behind Google Page Ranking Algorithm.
5. In Operating System, we come across the Resource Allocation Graph where each process and resources are considered to be vertices. Edges are drawn from resources to the allocated process, or from requesting process to the requested resource. If this leads to any formation of a cycle then a deadlock will occur.
1. A graph is a non-linear data structure, which consists of vertices (or nodes) connected by edges (or arcs) where edges may be directed or undirected.
Types of Graphs:
Though there are a lot of different types of graphs in discrete mathematics, there are some that are extremely common. Some of those are as follows:
1. Null graph: Also called an empty graph, a null graph is a graph in which there are no edges between any of its vertices.
2. Connected graph: A graph in which there is a path of edges between every pair of vertices in the graph. Mary's graph is a connected graph, since there is a way to get from every city on the map to every other city.
3.Disconnected graph: A graph in which the path of edges does not always connect every vertex.
4. Bipartite graph: A graph that can be split into two sets of vertices such that edges only go between sets, not within them.
5. Weighted graph: A graph in which weights, or numerical values, are assigned to each of the edges. Mary's graph is a weighted graph, where the distances between the cities are the weights of the edges.
6.Directed graph: A graph in which the edges are directed by arrows, indicating that the relationship, represented by the edge, only applies from one vertex to the other, but not the other way around. In other words, if a directed edge has an arrow from A to B, A is related to B, but B is not related to A.
7.Undirected graph: A graph whose edges are not directed. Mary's graph is an undirected graph, because the routes between cities go both ways.
8. Simple graph: An undirected graph in which there is at most one edge between each pair of vertices, and there are no loops, which is an edge from a vertex to itself.
9. Multi-graph: A graph in which there are multiple edges between any pair of vertices or there are edges from a vertex to itself, also called a loop.
10. Planar graph: A graph that can be drawn so that all of the edges of the graph do not cross each other.
11. Nonplanar graph: A graph that is not a planar graph. In other words, a graph that cannot be drawn without at least one pair of its edges crossing.
2. Application of Graph;
In Computer science graphs are used to represent the flow of computation.
1.Google maps uses graphs for building transportation systems, where intersection of two(or more) roads are considered to be a vertex and the road connecting two vertices is considered to be an edge, thus their navigation system is based on the algorithm to calculate the shortest path between two vertices.
2. In Facebook, users are considered to be the vertices and if they are friends then there is an edge running between them. Facebook’s Friend suggestion algorithm uses graph theory. Facebook is an example of undirected graph.
3. In World Wide Web, web pages are considered to be the vertices. There is an edge from a page u to other page v if there is a link of page v on page u. This is an example of Directed graph. It was the basic idea behind Google Page Ranking Algorithm.
4. In Operating System, we come across the Resource Allocation Graph where each process and resources are considered to be vertices. Edges are drawn from resources to the allocated process, or from requesting process to the requested resource. If this leads to any formation of a cycle, then a deadlock will occur
Types of Graphs:
Though there are a lot of different types of graphs in discrete mathematics, there are some that are extremely common. Some of those are as follows:
1. Null graph: Also called an empty graph, a null graph is a graph in which there are no edges between any of its vertices.
2. Connected graph: A graph in which there is a path of edges between every pair of vertices in the graph. Mary's graph is a connected graph, since there is a way to get from every city on the map to every other city.
3.Disconnected graph: A graph in which the path of edges does not always connect every vertex.
4. Bipartite graph: A graph that can be split into two sets of vertices such that edges only go between sets, not within them.
5. Weighted graph: A graph in which weights, or numerical values, are assigned to each of the edges. Mary's graph is a weighted graph, where the distances between the cities are the weights of the edges.
6.Directed graph: A graph in which the edges are directed by arrows, indicating that the relationship, represented by the edge, only applies from one vertex to the other, but not the other way around. In other words, if a directed edge has an arrow from A to B, A is related to B, but B is not related to A.
7.Undirected graph: A graph whose edges are not directed. Mary's graph is an undirected graph, because the routes between cities go both ways.
8. Simple graph: An undirected graph in which there is at most one edge between each pair of vertices, and there are no loops, which is an edge from a vertex to itself.
9. Multi-graph: A graph in which there are multiple edges between any pair of vertices or there are edges from a vertex to itself, also called a loop.
10. Planar graph: A graph that can be drawn so that all of the edges of the graph do not cross each other.
11. Nonplanar graph: A graph that is not a planar graph. In other words, a graph that cannot be drawn without at least one pair of its edges crossing.
2. Application of Graph;
In Computer science graphs are used to represent the flow of computation.
1.Google maps uses graphs for building transportation systems, where intersection of two(or more) roads are considered to be a vertex and the road connecting two vertices is considered to be an edge, thus their navigation system is based on the algorithm to calculate the shortest path between two vertices.
2. In Facebook, users are considered to be the vertices and if they are friends then there is an edge running between them. Facebook’s Friend suggestion algorithm uses graph theory. Facebook is an example of undirected graph.
3. In World Wide Web, web pages are considered to be the vertices. There is an edge from a page u to other page v if there is a link of page v on page u. This is an example of Directed graph. It was the basic idea behind Google Page Ranking Algorithm.
4. In Operating System, we come across the Resource Allocation Graph where each process and resources are considered to be vertices. Edges are drawn from resources to the allocated process, or from requesting process to the requested resource. If this leads to any formation of a cycle, then a deadlock will occur
Types of Graphs:
Though there are a lot of different types of graphs in discrete mathematics, there are some that are extremely common. Some of those are as follows:
1. Null graph.
2. Connected graph.
3.Disconnected graph.
4. Bipartite graph.
5. Weighted graph.
6.Directed graph.
8. Simple graph.
9. Multi-graph.
2. Application of Graph -
In Computer science graphs are used to represent the flow of computation.
1.Google maps uses graphs for building transportation systems, where intersection of two(or more) roads are considered to be a vertex and the road connecting two vertices is considered to be an edge, thus their navigation system is based on the algorithm to calculate the shortest path between two vertices.
Answer to the question no.1
A graph is a non-linear data structure, which consists of vertices (or nodes) connected by edges where edges may be directed or undirected.
Types of Graphs:
Though there are a lot of different types of graphs in discrete mathematics, there are some that are extremely common. Some of those are as follows:
1. Null graph.
2. Connected graph.
3.Disconnected graph.
4. Bipartite graph.
5. Weighted graph.
6.Directed graph.
8. Simple graph.
9. Multi-graph.
Application of Graph -
In Computer science graphs are used to represent the flow of computation.
1.Google maps uses graphs for building transportation systems, where intersection of two(or more) roads are considered to be a vertex and the road connecting two vertices is considered to be an edge, thus their navigation system is based on the algorithm to calculate the shortest path between two vertices.
Types of Graphs:
Though there are a lot of different types of graphs in discrete mathematics, there are some that are extremely common. Some of those are as follows:
1. Null graph.
2. Connected graph.
3.Disconnected graph.
4. Bipartite graph.
5. Weighted graph.
6.Directed graph.
8. Simple graph.
9. Multi-graph.
Answer to the question no.2
Application of Graph -
In Computer science graphs are used to represent the flow of computation.
1.Google maps uses graphs for building transportation systems, where intersection of two(or more) roads are considered to be a vertex and the road connecting two vertices is considered to be an edge, thus their navigation system is based on the algorithm to calculate the shortest path between two vertices.
#Answer for question:- 01
A graph could be a non-linear organization that's identical because of the mathematical (discrete mathematics) concept of graphs. It's a group of nodes (also called vertices) and edges that connect these vertices. Graphs are accustomed to represent the arbitrary relationship among objects. A graph will be directed or undirected. There are several different kinds of graphs.
- Null graph.
- Connected graph.
- Disconnected graph.
- Bipartite graph.
- Weighted graph.
- Directed graph.
- Simple graph.
- Multi-graph.
#Answer for question:- 02
The application of graph:
- In computing graphs are wont to represent the flow of computation.
- Google maps uses graphs for building transportation systems, where the intersection of two(or more) roads are considered to be a vertex and also the road connecting two vertices is taken into account to be a foothold, thus their navigation system relies on the algorithm to calculate the shortest path between two vertices.
- In Facebook, users are considered to be the vertices and if they're friends then there's a position running between them. Facebook’s Friend suggestion algorithm uses graph theory. Facebook is an example of an undirected graph.
- within the World Wide Web, sites are considered to be vertices. there's a grip from page u to page v if there's a link to page v on page u. This is often an example of a Directed graph. it had been the essential idea behind Google Page Ranking Algorithm.
- In the package, we stumble upon the Resource Allocation Graph where each process and resource is taken into account to be vertices. Edges are drawn from the allocated process, or from the requesting process to the requested resource. If this results in any formation of a cycle then a deadlock will occur.
Answer to the question no(1)
A graph is a non-linear data structure, which consists of vertices (or nodes) connected by edges where edges may be directed or undirected.
Types of Graphs:
Though there are a lot of different types of graphs in discrete mathematics, there are some that are extremely common. Some of those are as follows:
1. Null graph.
2. Connected graph.
3.Disconnected graph.
4. Bipartite graph.
5. Weighted graph.
6.Directed graph.
8. Simple graph.
9. Multi-graph.
Answer to the question no(2)
Application of Graph -
In Computer science graphs are used to represent the flow of computation.
1.Google maps uses graphs for building transportation systems, where intersection of two(or more) roads are considered to be a vertex and the road connecting two vertices is considered to be an edge, thus their navigation system is based on the algorithm to calculate the shortest path between two vertices.
2. In Facebook, users are considered to be the vertices and if they are friends then there is an edge running between them. Facebook’s Friend suggestion algorithm uses graph theory. Facebook is an example of undirected graph.
3. In World Wide Web, web pages are considered to be the vertices. There is an edge from a page u to other page v if there is a link of page v on page u. This is an example of Directed graph. It was the basic idea behind Google Page Ranking Algorithm.
4. In Operating System, we come across the Resource Allocation Graph where each process and resources are considered to be vertices. Edges are drawn from resources to the allocated process, or from requesting process to the requested resource. If this leads to any formation of a cycle, then a deadlock will occur.
A graph is a non-linear data structure, which consists of vertices (or nodes) connected by edges where edges may be directed or undirected.
Types of Graphs:
Though there are a lot of different types of graphs in discrete mathematics, there are some that are extremely common. Some of those are as follows:
1. Null graph.
2. Connected graph.
3.Disconnected graph.
4. Bipartite graph.
5. Weighted graph.
6.Directed graph.
8. Simple graph.
9. Multi-graph.
Answer to the question no(2)
Application of Graph -
In Computer science graphs are used to represent the flow of computation.
1.Google maps uses graphs for building transportation systems, where intersection of two(or more) roads are considered to be a vertex and the road connecting two vertices is considered to be an edge, thus their navigation system is based on the algorithm to calculate the shortest path between two vertices.
2. In Facebook, users are considered to be the vertices and if they are friends then there is an edge running between them. Facebook’s Friend suggestion algorithm uses graph theory. Facebook is an example of undirected graph.
3. In World Wide Web, web pages are considered to be the vertices. There is an edge from a page u to other page v if there is a link of page v on page u. This is an example of Directed graph. It was the basic idea behind Google Page Ranking Algorithm.
4. In Operating System, we come across the Resource Allocation Graph where each process and resources are considered to be vertices. Edges are drawn from resources to the allocated process, or from requesting process to the requested resource. If this leads to any formation of a cycle, then a deadlock will occur.
Answer to the question no:-01
A graph is a non-linear data structure, which consists of vertices (or nodes) connected by edges where edges may be directed or undirected.
Types of Graphs:
Though there are a lot of different types of graphs in discrete mathematics, there are some that are extremely common. Some of those are as follows:
Null graph.
Connected graph.
Disconnected graph.
Bipartite graph.
Weighted graph.
Directed graph.
Simple graph.
Multi-graph.
Answer to the question no:-02
Application of Graph -
In Computer science graphs are used to represent the flow of computation.
Google maps uses graphs for building transportation systems, where intersection of two(or more) roads are considered to be a vertex and the road connecting two vertices is considered to be an edge, thus their navigation system is based on the algorithm to calculate the shortest path between two vertices.
In Facebook, users are considered to be the vertices and if they are friends then there is an edge running between them. Facebook’s Friend suggestion algorithm uses graph theory. Facebook is an example of undirected graph.
In World Wide Web, web pages are considered to be the vertices. There is an edge from a page u to other page v if there is a link of page v on page u. This is an example of Directed graph. It was the basic idea behind Google Page Ranking Algorithm.
In Operating System, we come across the Resource Allocation Graph where each process and resources are considered to be vertices. Edges are drawn from resources to the allocated process, or from requesting process to the requested resource. If this leads to any formation of a cycle, then a deadlock will occur.
1. Answer:
A graph is a non-linear data structure that is the same as the mathematical (discrete mathematics) concept of graphs. It is a collection of nodes (also called vertices) and edges that connect these vertices. Graphs are used to represent the arbitrary relationship among objects. A graph can be directed or undirected.
There are several different types of charts and graphs. The four most common are probably line graphs, bar graphs and histograms, pie charts, and Cartesian graphs.
2. Answer:
The application of graph:
1. In Computer science graphs are used to represent the flow of computation.
2. Google maps uses graphs for building transportation systems, where the intersection of two(or more) roads are considered to be a vertex and the road connecting two vertices is considered to be an edge, thus their navigation system is based on the algorithm to calculate the shortest path between two vertices.
3. In Facebook, users are considered to be the vertices and if they are friends then there is an edge running between them. Facebook’s Friend suggestion algorithm uses graph theory. Facebook is an example of an undirected graph.
4. In the World Wide Web, web pages are considered to be vertices. There is an edge from page u to page v if there is a link to page v on page u. This is an example of a Directed graph. It was the basic idea behind Google Page Ranking Algorithm.
5. In Operating System, we come across the Resource Allocation Graph where each process and resource is considered to be vertices. Edges are drawn from resources to the allocated process, or from the requesting process to the requested resource. If this leads to any formation of a cycle then a deadlock will occur.
Ans: to the Ques: No. 1
A graph is a non-linear data structure, which consists of vertices (or nodes) connected by edges where edges may be directed or undirected.
Types of Graphs:
Though there are a lot of different types of graphs in discrete mathematics, there are some that are extremely common. Some of those are as follows:
1. Null graph.
2. Connected graph.
3.Disconnected graph.
4. Bipartite graph.
5. Weighted graph.
6.Directed graph.
8. Simple graph.
9. Multi-graph.
Ans: to the Ques: No. 2
Application of Graph -
In Computer science graphs are used to represent the flow of computation.
1.Google maps uses graphs for building transportation systems, where intersection of two(or more) roads are considered to be a vertex and the road connecting two vertices is considered to be an edge, thus their navigation system is based on the algorithm to calculate the shortest path between two vertices.
2. In Facebook, users are considered to be the vertices and if they are friends then there is an edge running between them. Facebook’s Friend suggestion algorithm uses graph theory. Facebook is an example of undirected graph.
3. In World Wide Web, web pages are considered to be the vertices. There is an edge from a page u to other page v if there is a link of page v on page u. This is an example of Directed graph. It was the basic idea behind Google Page Ranking Algorithm.
4. In Operating System, we come across the Resource Allocation Graph where each process and resources are considered to be vertices. Edges are drawn from resources to the allocated process, or from requesting process to the requested resource. If this leads to any formation of a cycle, then a deadlock will occur.
A graph is a non-linear data structure, which consists of vertices (or nodes) connected by edges where edges may be directed or undirected.
Types of Graphs:
Though there are a lot of different types of graphs in discrete mathematics, there are some that are extremely common. Some of those are as follows:
1. Null graph.
2. Connected graph.
3.Disconnected graph.
4. Bipartite graph.
5. Weighted graph.
6.Directed graph.
8. Simple graph.
9. Multi-graph.
Ans: to the Ques: No. 2
Application of Graph -
In Computer science graphs are used to represent the flow of computation.
1.Google maps uses graphs for building transportation systems, where intersection of two(or more) roads are considered to be a vertex and the road connecting two vertices is considered to be an edge, thus their navigation system is based on the algorithm to calculate the shortest path between two vertices.
2. In Facebook, users are considered to be the vertices and if they are friends then there is an edge running between them. Facebook’s Friend suggestion algorithm uses graph theory. Facebook is an example of undirected graph.
3. In World Wide Web, web pages are considered to be the vertices. There is an edge from a page u to other page v if there is a link of page v on page u. This is an example of Directed graph. It was the basic idea behind Google Page Ranking Algorithm.
4. In Operating System, we come across the Resource Allocation Graph where each process and resources are considered to be vertices. Edges are drawn from resources to the allocated process, or from requesting process to the requested resource. If this leads to any formation of a cycle, then a deadlock will occur.
Ans:to:q:no:01.
A graph is a non-linear data structure, which consists of vertices (or nodes) connected by edges where edges may be directed or undirected.
Types of Graphs:
Though there are a lot of different types of graphs in discrete mathematics, there are some that are extremely common. Some of those are as follows:
1. Null graph.
2. Connected graph.
3.Disconnected graph.
4. Bipartite graph.
5. Weighted graph.
6.Directed graph.
8. Simple graph.
9. Multi-graph.
Types of Graphs:
Though there are a lot of different types of graphs in discrete mathematics, there are some that are extremely common. Some of those are as follows:
1. Null graph.
2. Connected graph.
3.Disconnected graph.
4. Bipartite graph.
5. Weighted graph.
6.Directed graph.
8. Simple graph.
9. Multi-graph.
Ans:to:q:no:02
Application of Graph -
In Computer science graphs are used to represent the flow of computation.
1.Google maps uses graphs for building transportation systems, where intersection of two(or more) roads are considered to be a vertex and the road connecting two vertices is considered to be an edge, thus their navigation system is based on the algorithm to calculate the shortest path between two vertices.
In Computer science graphs are used to represent the flow of computation.
1.Google maps uses graphs for building transportation systems, where intersection of two(or more) roads are considered to be a vertex and the road connecting two vertices is considered to be an edge, thus their navigation system is based on the algorithm to calculate the shortest path between two vertices.
1. Answer:
Graph is a non-linear data structure that is same as the mathematical (discrete mathematics) concept of graphs. It is a collection of nodes (also called as vertices) and edges that connect these vertices. Graphs are used to represent arbitrary relationship among objects. A graph can be directed or undirected.
There are several different types of charts and graphs. The four most common are probably line graphs, bar graphs and histograms, pie charts, and Cartesian graphs.
2. Answer:
The application of graph:
1. In Computer science graphs are used to represent the flow of computation.
2. Google maps uses graphs for building transportation systems, where intersection of two(or more) roads are considered to be a vertex and the road connecting two vertices is considered to be an edge, thus their navigation system is based on the algorithm to calculate the shortest path between two vertices.
3. In Facebook, users are considered to be the vertices and if they are friends then there is an edge running between them. Facebook’s Friend suggestion algorithm uses graph theory. Facebook is an example of undirected graph.
4. In World Wide Web, web pages are considered to be the vertices. There is an edge from a page u to other page v if there is a link of page v on page u. This is an example of Directed graph. It was the basic idea behind Google Page Ranking Algorithm.
5. In Operating System, we come across the Resource Allocation Graph where each process and resources are considered to be vertices. Edges are drawn from resources to the allocated process, or from requesting process to the requested resource. If this leads to any formation of a cycle then a deadlock will occur.
Graph is a non-linear data structure that is same as the mathematical (discrete mathematics) concept of graphs. It is a collection of nodes (also called as vertices) and edges that connect these vertices. Graphs are used to represent arbitrary relationship among objects. A graph can be directed or undirected.
There are several different types of charts and graphs. The four most common are probably line graphs, bar graphs and histograms, pie charts, and Cartesian graphs.
2. Answer:
The application of graph:
1. In Computer science graphs are used to represent the flow of computation.
2. Google maps uses graphs for building transportation systems, where intersection of two(or more) roads are considered to be a vertex and the road connecting two vertices is considered to be an edge, thus their navigation system is based on the algorithm to calculate the shortest path between two vertices.
3. In Facebook, users are considered to be the vertices and if they are friends then there is an edge running between them. Facebook’s Friend suggestion algorithm uses graph theory. Facebook is an example of undirected graph.
4. In World Wide Web, web pages are considered to be the vertices. There is an edge from a page u to other page v if there is a link of page v on page u. This is an example of Directed graph. It was the basic idea behind Google Page Ranking Algorithm.
5. In Operating System, we come across the Resource Allocation Graph where each process and resources are considered to be vertices. Edges are drawn from resources to the allocated process, or from requesting process to the requested resource. If this leads to any formation of a cycle then a deadlock will occur.
1. Answer:
Graph is a non-linear data structure that is same as the mathematical (discrete mathematics) concept of graphs. It is a collection of nodes (also called as vertices) and edges that connect these vertices. Graphs are used to represent arbitrary relationship among objects. A graph can be directed or undirected.
There are several different types of charts and graphs. The four most common are probably line graphs, bar graphs and histograms, pie charts, and Cartesian graphs.
2. Answer:
The application of graph:
1. In Computer science graphs are used to represent the flow of computation.
2. Google maps uses graphs for building transportation systems, where intersection of two(or more) roads are considered to be a vertex and the road connecting two vertices is considered to be an edge, thus their navigation system is based on the algorithm to calculate the shortest path between two vertices.
3. In Facebook, users are considered to be the vertices and if they are friends then there is an edge running between them. Facebook’s Friend suggestion algorithm uses graph theory. Facebook is an example of undirected graph.
4. In World Wide Web, web pages are considered to be the vertices. There is an edge from a page u to other page v if there is a link of page v on page u. This is an example of Directed graph. It was the basic idea behind Google Page Ranking Algorithm.
5. In Operating System, we come across the Resource Allocation Graph where each process and resources are considered to be vertices. Edges are drawn from resources to the allocated process, or from requesting process to the requested resource. If this leads to any formation of a cycle then a deadlock will occur.
Graph is a non-linear data structure that is same as the mathematical (discrete mathematics) concept of graphs. It is a collection of nodes (also called as vertices) and edges that connect these vertices. Graphs are used to represent arbitrary relationship among objects. A graph can be directed or undirected.
There are several different types of charts and graphs. The four most common are probably line graphs, bar graphs and histograms, pie charts, and Cartesian graphs.
2. Answer:
The application of graph:
1. In Computer science graphs are used to represent the flow of computation.
2. Google maps uses graphs for building transportation systems, where intersection of two(or more) roads are considered to be a vertex and the road connecting two vertices is considered to be an edge, thus their navigation system is based on the algorithm to calculate the shortest path between two vertices.
3. In Facebook, users are considered to be the vertices and if they are friends then there is an edge running between them. Facebook’s Friend suggestion algorithm uses graph theory. Facebook is an example of undirected graph.
4. In World Wide Web, web pages are considered to be the vertices. There is an edge from a page u to other page v if there is a link of page v on page u. This is an example of Directed graph. It was the basic idea behind Google Page Ranking Algorithm.
5. In Operating System, we come across the Resource Allocation Graph where each process and resources are considered to be vertices. Edges are drawn from resources to the allocated process, or from requesting process to the requested resource. If this leads to any formation of a cycle then a deadlock will occur.
1. Answer:
Graph is a non-linear data structure that is same as the mathematical (discrete mathematics) concept of graphs. It is a collection of nodes (also called as vertices) and edges that connect these vertices. Graphs are used to represent arbitrary relationship among objects. A graph can be directed or undirected.
There are several different types of charts and graphs. The four most common are probably line graphs, bar graphs and histograms, pie charts, and Cartesian graphs.
2. Answer:
The application of graph:
1. In Computer science graphs are used to represent the flow of computation.
2. Google maps uses graphs for building transportation systems, where intersection of two(or more) roads are considered to be a vertex and the road connecting two vertices is considered to be an edge, thus their navigation system is based on the algorithm to calculate the shortest path between two vertices.
3. In Facebook, users are considered to be the vertices and if they are friends then there is an edge running between them. Facebook’s Friend suggestion algorithm uses graph theory. Facebook is an example of undirected graph.
4. In World Wide Web, web pages are considered to be the vertices. There is an edge from a page u to other page v if there is a link of page v on page u. This is an example of Directed graph. It was the basic idea behind Google Page Ranking Algorithm.
5. In Operating System, we come across the Resource Allocation Graph where each process and resources are considered to be vertices. Edges are drawn from resources to the allocated process, or from requesting process to the requested resource. If this leads to any formation of a cycle then a deadlock will occur.
Graph is a non-linear data structure that is same as the mathematical (discrete mathematics) concept of graphs. It is a collection of nodes (also called as vertices) and edges that connect these vertices. Graphs are used to represent arbitrary relationship among objects. A graph can be directed or undirected.
There are several different types of charts and graphs. The four most common are probably line graphs, bar graphs and histograms, pie charts, and Cartesian graphs.
2. Answer:
The application of graph:
1. In Computer science graphs are used to represent the flow of computation.
2. Google maps uses graphs for building transportation systems, where intersection of two(or more) roads are considered to be a vertex and the road connecting two vertices is considered to be an edge, thus their navigation system is based on the algorithm to calculate the shortest path between two vertices.
3. In Facebook, users are considered to be the vertices and if they are friends then there is an edge running between them. Facebook’s Friend suggestion algorithm uses graph theory. Facebook is an example of undirected graph.
4. In World Wide Web, web pages are considered to be the vertices. There is an edge from a page u to other page v if there is a link of page v on page u. This is an example of Directed graph. It was the basic idea behind Google Page Ranking Algorithm.
5. In Operating System, we come across the Resource Allocation Graph where each process and resources are considered to be vertices. Edges are drawn from resources to the allocated process, or from requesting process to the requested resource. If this leads to any formation of a cycle then a deadlock will occur.
Types of Graph:
1. Connected graph.
2. Null graph
3.Disconnected graph.
4.Directed graph.
5. Weighted graph.
6.Bipartite graph.
8. Simple graph.
9. Multi-graph.
2.
Application of Graph :
In Computer science graphs are used to represent the flow of computation.
1.Google maps uses graphs for building transportation systems, where intersection of two(or more) roads are considered to be a vertex and the road connecting two vertices is considered to be an edge, thus their navigation system is based on the algorithm to calculate the shortest path between two vertices.
1. Connected graph.
2. Null graph
3.Disconnected graph.
4.Directed graph.
5. Weighted graph.
6.Bipartite graph.
8. Simple graph.
9. Multi-graph.
2.
Application of Graph :
In Computer science graphs are used to represent the flow of computation.
1.Google maps uses graphs for building transportation systems, where intersection of two(or more) roads are considered to be a vertex and the road connecting two vertices is considered to be an edge, thus their navigation system is based on the algorithm to calculate the shortest path between two vertices.
1) Ans: A graph is a non-linear data structure, which consists of vertices (or nodes) connected by edges where edges may be directed or undirected.
Types of Graphs:
Though there are a lot of different types of graphs in discrete mathematics, there are some that are extremely common. Some of those are as follows:
1. Null graph.
2. Connected graph.
3.Disconnected graph.
4. Bipartite graph.
5. Weighted graph.
6.Directed graph.
8. Simple graph.
9. Multi-graph.
2) Ans: Application of Graph -
In Computer science graphs are used to represent the flow of computation.
1.Google maps uses graphs for building transportation systems, where intersection of two(or more) roads are considered to be a vertex and the road connecting two vertices is considered to be an edge, thus their navigation system is based on the algorithm to calculate the shortest path between two vertices.
2. In Facebook, users are considered to be the vertices and if they are friends then there is an edge running between them. Facebook’s Friend suggestion algorithm uses graph theory. Facebook is an example of undirected graph.
3. In World Wide Web, web pages are considered to be the vertices. There is an edge from a page u to other page v if there is a link of page v on page u. This is an example of Directed graph. It was the basic idea behind Google Page Ranking Algorithm.
4. In Operating System, we come across the Resource Allocation Graph where each process and resources are considered to be vertices. Edges are drawn from resources to the allocated process, or from requesting process to the requested resource. If this leads to any formation of a cycle, then a deadlock will occur.
Types of Graphs:
Though there are a lot of different types of graphs in discrete mathematics, there are some that are extremely common. Some of those are as follows:
1. Null graph.
2. Connected graph.
3.Disconnected graph.
4. Bipartite graph.
5. Weighted graph.
6.Directed graph.
8. Simple graph.
9. Multi-graph.
2) Ans: Application of Graph -
In Computer science graphs are used to represent the flow of computation.
1.Google maps uses graphs for building transportation systems, where intersection of two(or more) roads are considered to be a vertex and the road connecting two vertices is considered to be an edge, thus their navigation system is based on the algorithm to calculate the shortest path between two vertices.
2. In Facebook, users are considered to be the vertices and if they are friends then there is an edge running between them. Facebook’s Friend suggestion algorithm uses graph theory. Facebook is an example of undirected graph.
3. In World Wide Web, web pages are considered to be the vertices. There is an edge from a page u to other page v if there is a link of page v on page u. This is an example of Directed graph. It was the basic idea behind Google Page Ranking Algorithm.
4. In Operating System, we come across the Resource Allocation Graph where each process and resources are considered to be vertices. Edges are drawn from resources to the allocated process, or from requesting process to the requested resource. If this leads to any formation of a cycle, then a deadlock will occur.
1 no Answer:
Graph: A graph is a pictorial representation of a set of objects where some pairs of objects are connected by links.
Types of graph:
- Directed Graph
- Undirected Graph
- Weighted Graph
- Connected Graph
- Disconnected Graph
- Bipartite Graph
- Simple Graph
- Multi Graph
2 No Answer:
Applications of Graph:
- GPS navigation system
- Facebook Graphs API
- World Wide Web
- Googles knowledge graph
- Path Optimization Algorithm
1)Ans:
A graph is a non-linear data structure, which consists of vertices (or nodes) connected by edges where edges may be directed or undirected.
Types of Graphs:
Though there are a lot of different types of graphs in discrete mathematics, there are some that are extremely common. Some of those are as follows:
Null graph.
Connected graph.
Disconnected graph.
Bipartite graph.
Weighted graph.
Directed graph.
Simple graph.
Multi-graph.
2)Ans:
Application of Graph: -
In Computer science graphs are used to represent the flow of computation.Google maps uses graphs for building transportation systems, where intersection of two(or more) roads are considered to be a vertex and the road connecting two vertices is considered to be an edge, thus their navigation system is based on the algorithm to calculate the shortest path between two vertices.
In Facebook, users are considered to be the vertices and if they are friends then there is an edge running between them. Facebook’s Friend suggestion algorithm uses graph theory. Facebook is an example of an undirected graph.
In the Operating System, we come across the Resource Allocation Graph where each process and resources are considered to be vertices. Edges are drawn from resources to the allocated process, or from requesting process to the requested resource. If this leads to any formation of a cycle, then a deadlock will occur.
In World Wide Web, web pages are considered to be the vertices. There is an edge from a page u to other page v if there is a link of page v on page u. This is an example of Directed graph. It was the basic idea behind Google Page Ranking Algorithm.
A graph is a non-linear data structure, which consists of vertices (or nodes) connected by edges where edges may be directed or undirected.
Types of Graphs:
Though there are a lot of different types of graphs in discrete mathematics, there are some that are extremely common. Some of those are as follows:
Null graph.
Connected graph.
Disconnected graph.
Bipartite graph.
Weighted graph.
Directed graph.
Simple graph.
Multi-graph.
2)Ans:
Application of Graph: -
In Computer science graphs are used to represent the flow of computation.Google maps uses graphs for building transportation systems, where intersection of two(or more) roads are considered to be a vertex and the road connecting two vertices is considered to be an edge, thus their navigation system is based on the algorithm to calculate the shortest path between two vertices.
In Facebook, users are considered to be the vertices and if they are friends then there is an edge running between them. Facebook’s Friend suggestion algorithm uses graph theory. Facebook is an example of an undirected graph.
In the Operating System, we come across the Resource Allocation Graph where each process and resources are considered to be vertices. Edges are drawn from resources to the allocated process, or from requesting process to the requested resource. If this leads to any formation of a cycle, then a deadlock will occur.
In World Wide Web, web pages are considered to be the vertices. There is an edge from a page u to other page v if there is a link of page v on page u. This is an example of Directed graph. It was the basic idea behind Google Page Ranking Algorithm.
Answer to the que no. : 1
A graph is a non-linear data structure, which consists of vertices (or nodes) connected by edges where edges may be directed or undirected.
Types of Graphs:
Null graph, Connected graph, Disconnected graph, Bipartite graph, Weighted graph, Directed graph, Simple graph, Multi-graph.
Answer to the Q. No - 2
Some application of Graph :
In Computer science graphs are used to represent the flow of computation.
Google maps uses graphs for building transportation systems, where intersection of two(or more) roads are considered to be a vertex and the road connecting two vertices is considered to be an edge, thus their navigation system is based on the algorithm to calculate the shortest path between two vertices.
In Facebook, users are considered to be the vertices and if they are friends then there is an edge running between them. Facebook’s Friend suggestion algorithm uses graph theory. Facebook is an example of undirected graph.
In World Wide Web, web pages are considered to be the vertices. There is an edge from a page u to other page v if there is a link of page v on page u. This is an example of Directed graph. It was the basic idea behind Google Page Ranking Algorithm.
In Operating System, we come across the Resource Allocation Graph where each process and resources are considered to be vertices. Edges are drawn from resources to the allocated process, or from requesting process to the requested resource. If this leads to any formation of a cycle, then a deadlock will occur.
A graph is a non-linear data structure, which consists of vertices (or nodes) connected by edges where edges may be directed or undirected.
Types of Graphs:
Null graph, Connected graph, Disconnected graph, Bipartite graph, Weighted graph, Directed graph, Simple graph, Multi-graph.
Answer to the Q. No - 2
Some application of Graph :
In Computer science graphs are used to represent the flow of computation.
Google maps uses graphs for building transportation systems, where intersection of two(or more) roads are considered to be a vertex and the road connecting two vertices is considered to be an edge, thus their navigation system is based on the algorithm to calculate the shortest path between two vertices.
In Facebook, users are considered to be the vertices and if they are friends then there is an edge running between them. Facebook’s Friend suggestion algorithm uses graph theory. Facebook is an example of undirected graph.
In World Wide Web, web pages are considered to be the vertices. There is an edge from a page u to other page v if there is a link of page v on page u. This is an example of Directed graph. It was the basic idea behind Google Page Ranking Algorithm.
In Operating System, we come across the Resource Allocation Graph where each process and resources are considered to be vertices. Edges are drawn from resources to the allocated process, or from requesting process to the requested resource. If this leads to any formation of a cycle, then a deadlock will occur.
1. A graph is a non-linear data structure, which consists of vertices (or nodes) connected by edges where edges may be directed or undirected.
Types of Graphs:
Though there are a lot of different types of graphs in discrete mathematics, there are some that are extremely common. Some of those are as follows:
1. Null graph.
2. Connected graph.
3.Disconnected graph.
4. Bipartite graph.
5. Weighted graph.
6.Directed graph.
8. Simple graph.
9. Multi-graph.
2. Application of Graph -
In Computer science graphs are used to represent the flow of computation.
1.Google maps uses graphs for building transportation systems, where intersection of two(or more) roads are considered to be a vertex and the road connecting two vertices is considered to be an edge, thus their navigation system is based on the algorithm to calculate the shortest path between two vertices.
2. In Facebook, users are considered to be the vertices and if they are friends then there is an edge running between them. Facebook’s Friend suggestion algorithm uses graph theory. Facebook is an example of undirected graph.
3. In World Wide Web, web pages are considered to be the vertices. There is an edge from a page u to other page v if there is a link of page v on page u. This is an example of Directed graph. It was the basic idea behind Google Page Ranking Algorithm.
4. In Operating System, we come across the Resource Allocation Graph where each process and resources are considered to be vertices. Edges are drawn from resources to the allocated process, or from requesting process to the requested resource. If this leads to any formation of a cycle, then a deadlock will occur.
Types of Graphs:
Though there are a lot of different types of graphs in discrete mathematics, there are some that are extremely common. Some of those are as follows:
1. Null graph.
2. Connected graph.
3.Disconnected graph.
4. Bipartite graph.
5. Weighted graph.
6.Directed graph.
8. Simple graph.
9. Multi-graph.
2. Application of Graph -
In Computer science graphs are used to represent the flow of computation.
1.Google maps uses graphs for building transportation systems, where intersection of two(or more) roads are considered to be a vertex and the road connecting two vertices is considered to be an edge, thus their navigation system is based on the algorithm to calculate the shortest path between two vertices.
2. In Facebook, users are considered to be the vertices and if they are friends then there is an edge running between them. Facebook’s Friend suggestion algorithm uses graph theory. Facebook is an example of undirected graph.
3. In World Wide Web, web pages are considered to be the vertices. There is an edge from a page u to other page v if there is a link of page v on page u. This is an example of Directed graph. It was the basic idea behind Google Page Ranking Algorithm.
4. In Operating System, we come across the Resource Allocation Graph where each process and resources are considered to be vertices. Edges are drawn from resources to the allocated process, or from requesting process to the requested resource. If this leads to any formation of a cycle, then a deadlock will occur.
1 no Answer:
Graph: A graph is a pictorial representation of a set of objects where some pairs of objects are connected by links.
Types of graph:
Directed Graph
Undirected Graph
Weighted Graph
Connected Graph
Disconnected Graph
Bipartite Graph
Simple Graph
Multi Graph
2 No Answer:
Applications of Graph:
GPS navigation system
Facebook Graphs API
World Wide Web
Googles knowledge graph
Path Optimization Algorithm
Graph: A graph is a pictorial representation of a set of objects where some pairs of objects are connected by links.
Types of graph:
Directed Graph
Undirected Graph
Weighted Graph
Connected Graph
Disconnected Graph
Bipartite Graph
Simple Graph
Multi Graph
2 No Answer:
Applications of Graph:
GPS navigation system
Facebook Graphs API
World Wide Web
Googles knowledge graph
Path Optimization Algorithm
1. A graph is a non-linear data structure, which consists of vertices (or nodes) connected by edges where edges may be directed or undirected.
Types of Graphs:
Though there are a lot of different types of graphs in discrete mathematics, there are some that are extremely common. Some of those are as follows:
1. Null graph.
2. Connected graph.
3.Disconnected graph.
4. Bipartite graph.
5. Weighted graph.
6.Directed graph.
8. Simple graph.
9. Multi-graph.
2. Application of Graph -
In Computer science graphs are used to represent the flow of computation.
1.Google maps uses graphs for building transportation systems, where intersection of two(or more) roads are considered to be a vertex and the road connecting two vertices is considered to be an edge, thus their navigation system is based on the algorithm to calculate the shortest path between two vertices.
Types of Graphs:
Though there are a lot of different types of graphs in discrete mathematics, there are some that are extremely common. Some of those are as follows:
1. Null graph.
2. Connected graph.
3.Disconnected graph.
4. Bipartite graph.
5. Weighted graph.
6.Directed graph.
8. Simple graph.
9. Multi-graph.
2. Application of Graph -
In Computer science graphs are used to represent the flow of computation.
1.Google maps uses graphs for building transportation systems, where intersection of two(or more) roads are considered to be a vertex and the road connecting two vertices is considered to be an edge, thus their navigation system is based on the algorithm to calculate the shortest path between two vertices.
1.ANS-
A graph is a non-linear data structure, which consists of vertices (or nodes) connected by edges where edges may be directed or undirected.
Types of Graphs:
Though there are a lot of different types of graphs in discrete mathematics, there are some that are extremely common. Some of those are as follows:
1. Null graph.
2. Connected graph.
3.Disconnected graph.
4. Bipartite graph.
5. Weighted graph.
6.Directed graph.
8. Simple graph.
9. Multi-graph.
2. ANS-
Application of Graph -
In Computer science graphs are used to represent the flow of computation.
1.Google maps uses graphs for building transportation systems, where intersection of two(or more) roads are considered to be a vertex and the road connecting two vertices is considered to be an edge, thus their navigation system is based on the algorithm to calculate the shortest path between two vertices.
2. In Facebook, users are considered to be the vertices and if they are friends then there is an edge running between them. Facebook’s Friend suggestion algorithm uses graph theory. Facebook is an example of undirected graph.
3. In World Wide Web, web pages are considered to be the vertices. There is an edge from a page u to other page v if there is a link of page v on page u. This is an example of Directed graph. It was the basic idea behind Google Page Ranking Algorithm.
4. In Operating System, we come across the Resource Allocation Graph where each process and resources are considered to be vertices. Edges are drawn from resources to the allocated process, or from requesting process to the requested resource. If this leads to any formation of a cycle, then a deadlock will occur.
A graph is a non-linear data structure, which consists of vertices (or nodes) connected by edges where edges may be directed or undirected.
Types of Graphs:
Though there are a lot of different types of graphs in discrete mathematics, there are some that are extremely common. Some of those are as follows:
1. Null graph.
2. Connected graph.
3.Disconnected graph.
4. Bipartite graph.
5. Weighted graph.
6.Directed graph.
8. Simple graph.
9. Multi-graph.
2. ANS-
Application of Graph -
In Computer science graphs are used to represent the flow of computation.
1.Google maps uses graphs for building transportation systems, where intersection of two(or more) roads are considered to be a vertex and the road connecting two vertices is considered to be an edge, thus their navigation system is based on the algorithm to calculate the shortest path between two vertices.
2. In Facebook, users are considered to be the vertices and if they are friends then there is an edge running between them. Facebook’s Friend suggestion algorithm uses graph theory. Facebook is an example of undirected graph.
3. In World Wide Web, web pages are considered to be the vertices. There is an edge from a page u to other page v if there is a link of page v on page u. This is an example of Directed graph. It was the basic idea behind Google Page Ranking Algorithm.
4. In Operating System, we come across the Resource Allocation Graph where each process and resources are considered to be vertices. Edges are drawn from resources to the allocated process, or from requesting process to the requested resource. If this leads to any formation of a cycle, then a deadlock will occur.
1.ANS-
A graph is a non-linear data structure, which consists of vertices (or nodes) connected by edges where edges may be directed or undirected.
Types of Graphs:
Though there are a lot of different types of graphs in discrete mathematics, there are some that are extremely common. Some of those are as follows:
1. Null graph.
2. Connected graph.
3.Disconnected graph.
4. Bipartite graph.
5. Weighted graph.
6.Directed graph.
8. Simple graph.
9. Multi-graph.
2. ANS-
Application of Graph -
In Computer science graphs are used to represent the flow of computation.
1.Google maps uses graphs for building transportation systems, where intersection of two(or more) roads are considered to be a vertex and the road connecting two vertices is considered to be an edge, thus their navigation system is based on the algorithm to calculate the shortest path between two vertices.
2. In Facebook, users are considered to be the vertices and if they are friends then there is an edge running between them. Facebook’s Friend suggestion algorithm uses graph theory. Facebook is an example of undirected graph.
3. In World Wide Web, web pages are considered to be the vertices. There is an edge from a page u to other page v if there is a link of page v on page u. This is an example of Directed graph. It was the basic idea behind Google Page Ranking Algorithm.
4. In Operating System, we come across the Resource Allocation Graph where each process and resources are considered to be vertices. Edges are drawn from resources to the allocated process, or from requesting process to the requested resource. If this leads to any formation of a cycle, then a deadlock will occur.
A graph is a non-linear data structure, which consists of vertices (or nodes) connected by edges where edges may be directed or undirected.
Types of Graphs:
Though there are a lot of different types of graphs in discrete mathematics, there are some that are extremely common. Some of those are as follows:
1. Null graph.
2. Connected graph.
3.Disconnected graph.
4. Bipartite graph.
5. Weighted graph.
6.Directed graph.
8. Simple graph.
9. Multi-graph.
2. ANS-
Application of Graph -
In Computer science graphs are used to represent the flow of computation.
1.Google maps uses graphs for building transportation systems, where intersection of two(or more) roads are considered to be a vertex and the road connecting two vertices is considered to be an edge, thus their navigation system is based on the algorithm to calculate the shortest path between two vertices.
2. In Facebook, users are considered to be the vertices and if they are friends then there is an edge running between them. Facebook’s Friend suggestion algorithm uses graph theory. Facebook is an example of undirected graph.
3. In World Wide Web, web pages are considered to be the vertices. There is an edge from a page u to other page v if there is a link of page v on page u. This is an example of Directed graph. It was the basic idea behind Google Page Ranking Algorithm.
4. In Operating System, we come across the Resource Allocation Graph where each process and resources are considered to be vertices. Edges are drawn from resources to the allocated process, or from requesting process to the requested resource. If this leads to any formation of a cycle, then a deadlock will occur.
Types of Graphs:
Though there are a lot of different types of graphs in discrete mathematics, there are some that are extremely common. Some of those are as follows:
1. Null graph.
2. Connected graph.
3.Disconnected graph.
4. Bipartite graph.
5. Weighted graph.
6.Directed graph.
8. Simple graph.
9. Multi-graph.
2. Application of Graph -
In Computer science graphs are used to represent the flow of computation.
1.Google maps uses graphs for building transportation systems, where intersection of two(or more) roads are considered to be a vertex and the road connecting two vertices is considered to be an edge, thus their navigation system is based on the algorithm to calculate the shortest path between two vertices.
Though there are a lot of different types of graphs in discrete mathematics, there are some that are extremely common. Some of those are as follows:
1. Null graph.
2. Connected graph.
3.Disconnected graph.
4. Bipartite graph.
5. Weighted graph.
6.Directed graph.
8. Simple graph.
9. Multi-graph.
2. Application of Graph -
In Computer science graphs are used to represent the flow of computation.
1.Google maps uses graphs for building transportation systems, where intersection of two(or more) roads are considered to be a vertex and the road connecting two vertices is considered to be an edge, thus their navigation system is based on the algorithm to calculate the shortest path between two vertices.
Answer to the question number:1
A graph is a non-linear data structure, which consists of vertices (or nodes) connected by edges where edges may be directed or undirected.
Types of Graphs:
Though there are a lot of different types of graphs in discrete mathematics, there are some that are extremely common. Some of those are as follows:
1. Null graph.
2. Connected graph.
3.Disconnected graph.
4. Bipartite graph.
5. Weighted graph.
6.Directed graph.
8. Simple graph.
9. Multi-graph.
Answer to the question number:2
The application of graph:
1. In Computer science graphs are used to represent the flow of computation.
2. Google maps uses graphs for building transportation systems, where intersection of two(or more) roads are considered to be a vertex and the road connecting two vertices is considered to be an edge, thus their navigation system is based on the algorithm to calculate the shortest path between two vertices.
3. In Facebook, users are considered to be the vertices and if they are friends then there is an edge running between them. Facebook’s Friend suggestion algorithm uses graph theory. Facebook is an example of undirected graph.
4. In World Wide Web, web pages are considered to be the vertices. There is an edge from a page u to other page v if there is a link of page v on page u. This is an example of Directed graph. It was the basic idea behind Google Page Ranking Algorithm.
5. In Operating System, we come across the Resource Allocation Graph where each process and resources are considered to be vertices. Edges are drawn from resources to the allocated process, or from requesting process to the requested resource. If this leads to any formation of a cycle then a deadlock will occur.
a graph is a collection of points, called vertices, and lines between those points, called edges. There are many different types of graphs, such as connected and disconnected graphs, bipartite graphs, weighted graphs, directed and undirected graphs, and simple graphs.
1. A graph is a non-linear data structure, which consists of vertices (or nodes) connected by edges where edges may be directed or undirected.
Types of Graphs:
Though there are a lot of different types of graphs in discrete mathematics, there are some that are extremely common. Some of those are as follows:
1. Null graph.
2. Connected graph.
3.Disconnected graph.
4. Bipartite graph.
5. Weighted graph.
6.Directed graph.
8. Simple graph.
9. Multi-graph.
2. Application of Graph -
In Computer science graphs are used to represent the flow of computation.
1.Google maps uses graphs for building transportation systems, where intersection of two(or more) roads are considered to be a vertex and the road connecting two vertices is considered to be an edge, thus their navigation system is based on the algorithm to calculate the shortest path between two vertices.
2. In Facebook, users are considered to be the vertices and if they are friends then there is an edge running between them. Facebook’s Friend suggestion algorithm uses graph theory. Facebook is an example of undirected graph.
3. In World Wide Web, web pages are considered to be the vertices. There is an edge from a page u to other page v if there is a link of page v on page u. This is an example of Directed graph. It was the basic idea behind Google Page Ranking Algorithm.
4. In Operating System, we come across the Resource Allocation Graph where each process and resources are considered to be vertices. Edges are drawn from resources to the allocated process, or from requesting process to the requested resource. If this leads to any formation of a cycle, then a deadlock will occur.
Types of Graphs:
Though there are a lot of different types of graphs in discrete mathematics, there are some that are extremely common. Some of those are as follows:
1. Null graph.
2. Connected graph.
3.Disconnected graph.
4. Bipartite graph.
5. Weighted graph.
6.Directed graph.
8. Simple graph.
9. Multi-graph.
2. Application of Graph -
In Computer science graphs are used to represent the flow of computation.
1.Google maps uses graphs for building transportation systems, where intersection of two(or more) roads are considered to be a vertex and the road connecting two vertices is considered to be an edge, thus their navigation system is based on the algorithm to calculate the shortest path between two vertices.
2. In Facebook, users are considered to be the vertices and if they are friends then there is an edge running between them. Facebook’s Friend suggestion algorithm uses graph theory. Facebook is an example of undirected graph.
3. In World Wide Web, web pages are considered to be the vertices. There is an edge from a page u to other page v if there is a link of page v on page u. This is an example of Directed graph. It was the basic idea behind Google Page Ranking Algorithm.
4. In Operating System, we come across the Resource Allocation Graph where each process and resources are considered to be vertices. Edges are drawn from resources to the allocated process, or from requesting process to the requested resource. If this leads to any formation of a cycle, then a deadlock will occur.
1. A graph is a non-linear data structure, which consists of vertices (or nodes) connected by edges where edges may be directed or undirected.
Types of Graphs:
Though there are a lot of different types of graphs in discrete mathematics, there are some that are extremely common. Some of those are as follows:
1. Null graph.
2. Connected graph.
3.Disconnected graph.
4. Bipartite graph.
5. Weighted graph.
6.Directed graph.
8. Simple graph.
9. Multi-graph.
2. Application of Graph;
In Computer science graphs are used to represent the flow of computation.
1.Google maps uses graphs for building transportation systems, where intersection of two(or more) roads are considered to be a vertex and the road connecting two vertices is considered to be an edge, thus their navigation system is based on the algorithm to calculate the shortest path between two vertices.
2. In Facebook, users are considered to be the vertices and if they are friends then there is an edge running between them. Facebook’s Friend suggestion algorithm uses graph theory. Facebook is an example of undirected.
Types of Graphs:
Though there are a lot of different types of graphs in discrete mathematics, there are some that are extremely common. Some of those are as follows:
1. Null graph.
2. Connected graph.
3.Disconnected graph.
4. Bipartite graph.
5. Weighted graph.
6.Directed graph.
8. Simple graph.
9. Multi-graph.
2. Application of Graph;
In Computer science graphs are used to represent the flow of computation.
1.Google maps uses graphs for building transportation systems, where intersection of two(or more) roads are considered to be a vertex and the road connecting two vertices is considered to be an edge, thus their navigation system is based on the algorithm to calculate the shortest path between two vertices.
2. In Facebook, users are considered to be the vertices and if they are friends then there is an edge running between them. Facebook’s Friend suggestion algorithm uses graph theory. Facebook is an example of undirected.
Types of Graphs:
Though there are a lot of different types of graphs in discrete mathematics, there are some that are extremely common. Some of those are as follows:
1. Null graph.
2. Connected graph.
3.Disconnected graph.
4. Bipartite graph.
5. Weighted graph.
6.Directed graph.
8. Simple graph.
9. Multi-graph.
2. Application of Graph -
In Computer science graphs are used to represent the flow of computation.
1.Google maps uses graphs for building transportation systems, where intersection of two(or more) roads are considered to be a vertex and the road connecting two vertices is considered to be an edge, thus their navigation system is based on the algorithm to calculate the shortest path between two vertices.
Though there are a lot of different types of graphs in discrete mathematics, there are some that are extremely common. Some of those are as follows:
1. Null graph.
2. Connected graph.
3.Disconnected graph.
4. Bipartite graph.
5. Weighted graph.
6.Directed graph.
8. Simple graph.
9. Multi-graph.
2. Application of Graph -
In Computer science graphs are used to represent the flow of computation.
1.Google maps uses graphs for building transportation systems, where intersection of two(or more) roads are considered to be a vertex and the road connecting two vertices is considered to be an edge, thus their navigation system is based on the algorithm to calculate the shortest path between two vertices.
Ans to the Q.no-1.
A graph is a non linear data structure, which consists of vertices (or nodes) connected by edges where edges may be directed or undirected .
Types of Graphs:
There are different types of graphs in discrete mathematics, there are some that are extremely common. Some of those are as follows:
1. Null graph.
2. Connected graph.
3.Disconnected graph.
4. Bipartite graph.
5. Weighted graph.
6.Directed graph.
8. Simple graph.
9. Multi-graph.
Ans to the Q.no-2.
Application of Graph -
In Computer science graphs are used to represent the flow of computation.
1.Google maps uses graphs for building transportation systems, where intersection of two(or more) roads are considered to be a vertex and the road connecting two vertices is considered to be an edge, thus their navigation system is based on the algorithm to calculate the shortest path between two vertices.
A graph is a non linear data structure, which consists of vertices (or nodes) connected by edges where edges may be directed or undirected .
Types of Graphs:
There are different types of graphs in discrete mathematics, there are some that are extremely common. Some of those are as follows:
1. Null graph.
2. Connected graph.
3.Disconnected graph.
4. Bipartite graph.
5. Weighted graph.
6.Directed graph.
8. Simple graph.
9. Multi-graph.
Ans to the Q.no-2.
Application of Graph -
In Computer science graphs are used to represent the flow of computation.
1.Google maps uses graphs for building transportation systems, where intersection of two(or more) roads are considered to be a vertex and the road connecting two vertices is considered to be an edge, thus their navigation system is based on the algorithm to calculate the shortest path between two vertices.
A graph is a non linear data structure, which consists of vertices (or nodes) connected by edges where edges may be directed or undirected .
There are several different types of charts and graphs. The four most common are probably line graphs, bar graphs and histograms, pie charts, and Cartesian graphs.
In computer science, graph is used to represent networks of communication, data organization, computational devices etc. Physics and Chemistry: Graph theory is also used to study molecules in chemistry and physics. Social Science: Graph theory is also widely used in sociology
There are several different types of charts and graphs. The four most common are probably line graphs, bar graphs and histograms, pie charts, and Cartesian graphs.
In computer science, graph is used to represent networks of communication, data organization, computational devices etc. Physics and Chemistry: Graph theory is also used to study molecules in chemistry and physics. Social Science: Graph theory is also widely used in sociology
1. A graph is a non-linear data structure, which consists of vertices (or nodes) connected by edges (or arcs) where edges may be directed or undirected.
Types of Graphs:
Though there are a lot of different types of graphs in discrete mathematics, there are some that are extremely common. Some of those are as follows:
1. Null graph: Also called an empty graph, a null graph is a graph in which there are no edges between any of its vertices.
2. Connected graph: A graph in which there is a path of edges between every pair of vertices in the graph. Mary's graph is a connected graph, since there is a way to get from every city on the map to every other city.
3.Disconnected graph: A graph in which the path of edges does not always connect every vertex.
4. Bipartite graph: A graph that can be split into two sets of vertices such that edges only go between sets, not within them.
5. Weighted graph: A graph in which weights, or numerical values, are assigned to each of the edges. Mary's graph is a weighted graph, where the distances between the cities are the weights of the edges.
6.Directed graph: A graph in which the edges are directed by arrows, indicating that the relationship, represented by the edge, only applies from one vertex to the other, but not the other way around. In other words, if a directed edge has an arrow from A to B, A is related to B, but B is not related to A.
7.Undirected graph: A graph whose edges are not directed. Mary's graph is an undirected graph, because the routes between cities go both ways.
8. Simple graph: An undirected graph in which there is at most one edge between each pair of vertices, and there are no loops, which is an edge from a vertex to itself.
9. Multi-graph: A graph in which there are multiple edges between any pair of vertices or there are edges from a vertex to itself, also called a loop.
10. Planar graph: A graph that can be drawn so that all of the edges of the graph do not cross each other.
11. Nonplanar graph: A graph that is not a planar graph. In other words, a graph that cannot be drawn without at least one pair of its edges crossing.
2. Application of Graph;
In Computer science graphs are used to represent the flow of computation.
1.Google maps uses graphs for building transportation systems, where intersection of two(or more) roads are considered to be a vertex and the road connecting two vertices is considered to be an edge, thus their navigation system is based on the algorithm to calculate the shortest path between two vertices.
2. In Facebook, users are considered to be the vertices and if they are friends then there is an edge running between them. Facebook’s Friend suggestion algorithm uses graph theory. Facebook is an example of undirected graph.
3. In World Wide Web, web pages are considered to be the vertices. There is an edge from a page u to other page v if there is a link of page v on page u. This is an example of Directed graph. It was the basic idea behind Google Page Ranking Algorithm.
4. In Operating System, we come across the Resource Allocation Graph where each process and resources are considered to be vertices. Edges are drawn from resources to the allocated process, or from requesting process to the requested resource. If this leads to any formation of a cycle, then a deadlock will occur.
Picture of 201-15-3293 Abdur Razzak
In reply to Md Assaduzzaman
Re: Answer the question
by 201-15-3293 Abdur Razzak - Thursday, 3 December 2020, 10:59 PM
Picture of DS-(PC-J) Picture of DSLab-(PC-J)
1. Answer:
Graph is a non-linear data structure that is same as the mathematical (discrete mathematics) concept of graphs. It is a collection of nodes (also called as vertices) and edges that connect these vertices. Graphs are used to represent arbitrary relationship among objects. A graph can be directed or undirected.
There are several different types of charts and graphs. The four most common are probably line graphs, bar graphs and histograms, pie charts, and Cartesian graphs.
2. Answer:
The application of graph:
1. In Computer science graphs are used to represent the flow of computation.
2. Google maps uses graphs for building transportation systems, where intersection of two(or more) roads are considered to be a vertex and the road connecting two vertices is considered to be an edge, thus their navigation system is based on the algorithm to calculate the shortest path between two vertices.
3. In Facebook, users are considered to be the vertices and if they are friends then there is an edge running between them. Facebook’s Friend suggestion algorithm uses graph theory. Facebook is an example of undirected graph.
4. In World Wide Web, web pages are considered to be the vertices. There is an edge from a page u to other page v if there is a link of page v on page u. This is an example of Directed graph. It was the basic idea behind Google Page Ranking Algorithm.
5. In Operating System, we come across the Resource Allocation Graph where each process and resources are considered to be vertices. Edges are drawn from resources to the allocated process, or from requesting process to the requested resource. If this leads to any formation of a cycle then a deadlock will occur.
Picture of Ordha Nafiz Akbar15-3166
In reply to Md Assaduzzaman
Re: Answer the question
by Ordha Nafiz Akbar15-3166 - Thursday, 3 December 2020, 11:58 PM
Picture of DS-(PC-F)
1. A graph is a non-linear data structure, which consists of vertices (or nodes) connected by edges where edges may be directed or undirected.
Types of Graphs:
Though there are a lot of different types of graphs in discrete mathematics, there are some that are extremely common. Some of those are as follows:
1. Null graph.
2. Connected graph.
3.Disconnected graph.
4. Bipartite graph.
5. Weighted graph.
6.Directed graph.
8. Simple graph.
9. Multi-graph.
2. Application of Graph -
In Computer science graphs are used to represent the flow of computation.
1.Google maps uses graphs for building transportation systems, where intersection of two(or more) roads are considered to be a vertex and the road connecting two vertices is considered to be an edge, thus their navigation system is based on the algorithm to calculate the shortest path between two vertices.
2. In Facebook, users are considered to be the vertices and if they are friends then there is an edge running between them. Facebook’s Friend suggestion algorithm uses graph theory. Facebook is an example of undirected graph.
3. In World Wide Web, web pages are considered to be the vertices. There is an edge from a page u to other page v if there is a link of page v on page u. This is an example of Directed graph. It was the basic idea behind Google Page Ranking Algorithm.
4. In Operating System, we come across the Resource Allocation Graph where each process and resources are considered to be vertices. Edges are drawn from resources to the allocated process, or from requesting process to the requested resource. If this leads to any formation of a cycle, then a deadlock will occur.
Types of Graphs:
Though there are a lot of different types of graphs in discrete mathematics, there are some that are extremely common. Some of those are as follows:
1. Null graph: Also called an empty graph, a null graph is a graph in which there are no edges between any of its vertices.
2. Connected graph: A graph in which there is a path of edges between every pair of vertices in the graph. Mary's graph is a connected graph, since there is a way to get from every city on the map to every other city.
3.Disconnected graph: A graph in which the path of edges does not always connect every vertex.
4. Bipartite graph: A graph that can be split into two sets of vertices such that edges only go between sets, not within them.
5. Weighted graph: A graph in which weights, or numerical values, are assigned to each of the edges. Mary's graph is a weighted graph, where the distances between the cities are the weights of the edges.
6.Directed graph: A graph in which the edges are directed by arrows, indicating that the relationship, represented by the edge, only applies from one vertex to the other, but not the other way around. In other words, if a directed edge has an arrow from A to B, A is related to B, but B is not related to A.
7.Undirected graph: A graph whose edges are not directed. Mary's graph is an undirected graph, because the routes between cities go both ways.
8. Simple graph: An undirected graph in which there is at most one edge between each pair of vertices, and there are no loops, which is an edge from a vertex to itself.
9. Multi-graph: A graph in which there are multiple edges between any pair of vertices or there are edges from a vertex to itself, also called a loop.
10. Planar graph: A graph that can be drawn so that all of the edges of the graph do not cross each other.
11. Nonplanar graph: A graph that is not a planar graph. In other words, a graph that cannot be drawn without at least one pair of its edges crossing.
2. Application of Graph;
In Computer science graphs are used to represent the flow of computation.
1.Google maps uses graphs for building transportation systems, where intersection of two(or more) roads are considered to be a vertex and the road connecting two vertices is considered to be an edge, thus their navigation system is based on the algorithm to calculate the shortest path between two vertices.
2. In Facebook, users are considered to be the vertices and if they are friends then there is an edge running between them. Facebook’s Friend suggestion algorithm uses graph theory. Facebook is an example of undirected graph.
3. In World Wide Web, web pages are considered to be the vertices. There is an edge from a page u to other page v if there is a link of page v on page u. This is an example of Directed graph. It was the basic idea behind Google Page Ranking Algorithm.
4. In Operating System, we come across the Resource Allocation Graph where each process and resources are considered to be vertices. Edges are drawn from resources to the allocated process, or from requesting process to the requested resource. If this leads to any formation of a cycle, then a deadlock will occur.
Picture of 201-15-3293 Abdur Razzak
In reply to Md Assaduzzaman
Re: Answer the question
by 201-15-3293 Abdur Razzak - Thursday, 3 December 2020, 10:59 PM
Picture of DS-(PC-J) Picture of DSLab-(PC-J)
1. Answer:
Graph is a non-linear data structure that is same as the mathematical (discrete mathematics) concept of graphs. It is a collection of nodes (also called as vertices) and edges that connect these vertices. Graphs are used to represent arbitrary relationship among objects. A graph can be directed or undirected.
There are several different types of charts and graphs. The four most common are probably line graphs, bar graphs and histograms, pie charts, and Cartesian graphs.
2. Answer:
The application of graph:
1. In Computer science graphs are used to represent the flow of computation.
2. Google maps uses graphs for building transportation systems, where intersection of two(or more) roads are considered to be a vertex and the road connecting two vertices is considered to be an edge, thus their navigation system is based on the algorithm to calculate the shortest path between two vertices.
3. In Facebook, users are considered to be the vertices and if they are friends then there is an edge running between them. Facebook’s Friend suggestion algorithm uses graph theory. Facebook is an example of undirected graph.
4. In World Wide Web, web pages are considered to be the vertices. There is an edge from a page u to other page v if there is a link of page v on page u. This is an example of Directed graph. It was the basic idea behind Google Page Ranking Algorithm.
5. In Operating System, we come across the Resource Allocation Graph where each process and resources are considered to be vertices. Edges are drawn from resources to the allocated process, or from requesting process to the requested resource. If this leads to any formation of a cycle then a deadlock will occur.
Picture of Ordha Nafiz Akbar15-3166
In reply to Md Assaduzzaman
Re: Answer the question
by Ordha Nafiz Akbar15-3166 - Thursday, 3 December 2020, 11:58 PM
Picture of DS-(PC-F)
1. A graph is a non-linear data structure, which consists of vertices (or nodes) connected by edges where edges may be directed or undirected.
Types of Graphs:
Though there are a lot of different types of graphs in discrete mathematics, there are some that are extremely common. Some of those are as follows:
1. Null graph.
2. Connected graph.
3.Disconnected graph.
4. Bipartite graph.
5. Weighted graph.
6.Directed graph.
8. Simple graph.
9. Multi-graph.
2. Application of Graph -
In Computer science graphs are used to represent the flow of computation.
1.Google maps uses graphs for building transportation systems, where intersection of two(or more) roads are considered to be a vertex and the road connecting two vertices is considered to be an edge, thus their navigation system is based on the algorithm to calculate the shortest path between two vertices.
2. In Facebook, users are considered to be the vertices and if they are friends then there is an edge running between them. Facebook’s Friend suggestion algorithm uses graph theory. Facebook is an example of undirected graph.
3. In World Wide Web, web pages are considered to be the vertices. There is an edge from a page u to other page v if there is a link of page v on page u. This is an example of Directed graph. It was the basic idea behind Google Page Ranking Algorithm.
4. In Operating System, we come across the Resource Allocation Graph where each process and resources are considered to be vertices. Edges are drawn from resources to the allocated process, or from requesting process to the requested resource. If this leads to any formation of a cycle, then a deadlock will occur.
1.
Graph is a non-linear data structure that is same as the mathematical (discrete mathematics) concept of graphs. It is a collection of nodes (also called as vertices) and edges that connect these vertices. Graphs are used to represent arbitrary relationship among objects. A graph can be directed or undirected.
There are several different types of charts and graphs. The four most common are probably line graphs, bar graphs and histograms, pie charts, and Cartesian graphs.
2.
The application of graph:
1. In Computer science graphs are used to represent the flow of computation.
2. Google maps uses graphs for building transportation systems, where intersection of two(or more) roads are considered to be a vertex and the road connecting two vertices is considered to be an edge, thus their navigation system is based on the algorithm to calculate the shortest path between two vertices.
3. In Facebook, users are considered to be the vertices and if they are friends then there is an edge running between them. Facebook’s Friend suggestion algorithm uses graph theory. Facebook is an example of undirected graph.
4. In World Wide Web, web pages are considered to be the vertices. There is an edge from a page u to other page v if there is a link of page v on page u. This is an example of Directed graph. It was the basic idea behind Google Page Ranking Algorithm.
5. In Operating System, we come across the Resource Allocation Graph where each process and resources are considered to be vertices. Edges are drawn from resources to the allocated process, or from requesting process to the requested resource. If this leads to any formation of a cycle then a deadlock will occur.
Graph is a non-linear data structure that is same as the mathematical (discrete mathematics) concept of graphs. It is a collection of nodes (also called as vertices) and edges that connect these vertices. Graphs are used to represent arbitrary relationship among objects. A graph can be directed or undirected.
There are several different types of charts and graphs. The four most common are probably line graphs, bar graphs and histograms, pie charts, and Cartesian graphs.
2.
The application of graph:
1. In Computer science graphs are used to represent the flow of computation.
2. Google maps uses graphs for building transportation systems, where intersection of two(or more) roads are considered to be a vertex and the road connecting two vertices is considered to be an edge, thus their navigation system is based on the algorithm to calculate the shortest path between two vertices.
3. In Facebook, users are considered to be the vertices and if they are friends then there is an edge running between them. Facebook’s Friend suggestion algorithm uses graph theory. Facebook is an example of undirected graph.
4. In World Wide Web, web pages are considered to be the vertices. There is an edge from a page u to other page v if there is a link of page v on page u. This is an example of Directed graph. It was the basic idea behind Google Page Ranking Algorithm.
5. In Operating System, we come across the Resource Allocation Graph where each process and resources are considered to be vertices. Edges are drawn from resources to the allocated process, or from requesting process to the requested resource. If this leads to any formation of a cycle then a deadlock will occur.
1.
Graph is a non-linear data structure that is same as the mathematical (discrete mathematics) concept of graphs. It is a collection of nodes (also called as vertices) and edges that connect these vertices. Graphs are used to represent arbitrary relationship among objects. A graph can be directed or undirected.
There are several different types of charts and graphs. The four most common are probably line graphs, bar graphs and histograms, pie charts, and Cartesian graphs.
2.
The application of graph:
1. In Computer science graphs are used to represent the flow of computation.
2. Google maps uses graphs for building transportation systems, where intersection of two(or more) roads are considered to be a vertex and the road connecting two vertices is considered to be an edge, thus their navigation system is based on the algorithm to calculate the shortest path between two vertices.
3. In Facebook, users are considered to be the vertices and if they are friends then there is an edge running between them. Facebook’s Friend suggestion algorithm uses graph theory. Facebook is an example of undirected graph.
4. In World Wide Web, web pages are considered to be the vertices. There is an edge from a page u to other page v if there is a link of page v on page u. This is an example of Directed graph. It was the basic idea behind Google Page Ranking Algorithm.
5. In Operating System, we come across the Resource Allocation Graph where each process and resources are considered to be vertices. Edges are drawn from resources to the allocated process, or from requesting process to the requested resource. If this leads to any formation of a cycle then a deadlock will occur.
Graph is a non-linear data structure that is same as the mathematical (discrete mathematics) concept of graphs. It is a collection of nodes (also called as vertices) and edges that connect these vertices. Graphs are used to represent arbitrary relationship among objects. A graph can be directed or undirected.
There are several different types of charts and graphs. The four most common are probably line graphs, bar graphs and histograms, pie charts, and Cartesian graphs.
2.
The application of graph:
1. In Computer science graphs are used to represent the flow of computation.
2. Google maps uses graphs for building transportation systems, where intersection of two(or more) roads are considered to be a vertex and the road connecting two vertices is considered to be an edge, thus their navigation system is based on the algorithm to calculate the shortest path between two vertices.
3. In Facebook, users are considered to be the vertices and if they are friends then there is an edge running between them. Facebook’s Friend suggestion algorithm uses graph theory. Facebook is an example of undirected graph.
4. In World Wide Web, web pages are considered to be the vertices. There is an edge from a page u to other page v if there is a link of page v on page u. This is an example of Directed graph. It was the basic idea behind Google Page Ranking Algorithm.
5. In Operating System, we come across the Resource Allocation Graph where each process and resources are considered to be vertices. Edges are drawn from resources to the allocated process, or from requesting process to the requested resource. If this leads to any formation of a cycle then a deadlock will occur.
1.
Though there are a lot of different types of graphs in discrete mathematics, there are some that are extremely common. Some of those are as follows:
1. Null graph.
2. Connected graph.
3.Disconnected graph.
4. Bipartite graph.
5. Weighted graph.
6.Directed graph.
8. Simple graph.
9. Multi-graph.
2. Application of Graph -
In Computer science graphs are used to represent the flow of computation.
1.Google maps uses graphs for building transportation systems, where intersection of two(or more) roads are considered to be a vertex and the road connecting two vertices is considered to be an edge, thus their navigation system is based on the algorithm to calculate the shortest path between two vertices.
Though there are a lot of different types of graphs in discrete mathematics, there are some that are extremely common. Some of those are as follows:
1. Null graph.
2. Connected graph.
3.Disconnected graph.
4. Bipartite graph.
5. Weighted graph.
6.Directed graph.
8. Simple graph.
9. Multi-graph.
2. Application of Graph -
In Computer science graphs are used to represent the flow of computation.
1.Google maps uses graphs for building transportation systems, where intersection of two(or more) roads are considered to be a vertex and the road connecting two vertices is considered to be an edge, thus their navigation system is based on the algorithm to calculate the shortest path between two vertices.
1.
Graph is a non-linear data structure that is same as the mathematical (discrete mathematics) concept of graphs. It is a collection of nodes (also called as vertices) and edges that connect these vertices. Graphs are used to represent arbitrary relationship among objects. A graph can be directed or undirected.
There are several different types of charts and graphs. The four most common are probably line graphs, bar graphs and histograms, pie charts, and Cartesian graphs.
2.
Application of Graph -
In Computer science graphs are used to represent the flow of computation.
1.Google maps uses graphs for building transportation systems, where intersection of two(or more) roads are considered to be a vertex and the road connecting two vertices is considered to be an edge, thus their navigation system is based on the algorithm to calculate the shortest path between two vertices.
2. In Facebook, users are considered to be the vertices and if they are friends then there is an edge running between them. Facebook’s Friend suggestion algorithm uses graph theory. Facebook is an example of undirected graph.
3. In World Wide Web, web pages are considered to be the vertices. There is an edge from a page u to other page v if there is a link of page v on page u. This is an example of Directed graph. It was the basic idea behind Google Page Ranking Algorithm.
4. In Operating System, we come across the Resource Allocation Graph where each process and resources are considered to be vertices. Edges are drawn from resources to the allocated process, or from requesting process to the requested resource. If this leads to any formation of a cycle, then a deadlock will occur.
Graph is a non-linear data structure that is same as the mathematical (discrete mathematics) concept of graphs. It is a collection of nodes (also called as vertices) and edges that connect these vertices. Graphs are used to represent arbitrary relationship among objects. A graph can be directed or undirected.
There are several different types of charts and graphs. The four most common are probably line graphs, bar graphs and histograms, pie charts, and Cartesian graphs.
2.
Application of Graph -
In Computer science graphs are used to represent the flow of computation.
1.Google maps uses graphs for building transportation systems, where intersection of two(or more) roads are considered to be a vertex and the road connecting two vertices is considered to be an edge, thus their navigation system is based on the algorithm to calculate the shortest path between two vertices.
2. In Facebook, users are considered to be the vertices and if they are friends then there is an edge running between them. Facebook’s Friend suggestion algorithm uses graph theory. Facebook is an example of undirected graph.
3. In World Wide Web, web pages are considered to be the vertices. There is an edge from a page u to other page v if there is a link of page v on page u. This is an example of Directed graph. It was the basic idea behind Google Page Ranking Algorithm.
4. In Operating System, we come across the Resource Allocation Graph where each process and resources are considered to be vertices. Edges are drawn from resources to the allocated process, or from requesting process to the requested resource. If this leads to any formation of a cycle, then a deadlock will occur.
Types of Graph:
1. Connected graph.
2. Null graph
3.Disconnected graph.
4.Directed graph.
5. Weighted graph.
6.Bipartite graph.
8. Simple graph.
9. Multi-graph.
2.
Application of Graph :
In Computer science graphs are used to represent the flow of computation.
1.Google maps uses graphs for building transportation systems, where intersection of two(or more) roads are considered to be a vertex and the road connecting two vertices is considered to be an edge, thus their navigation system is based on the algorithm to calculate the shortest path between two vertices.
Answer to the Q. No - 1
A graph is a non-linear data structure, which consists of vertices (or nodes) connected by edges where edges may be directed or undirected.
Types of Graphs:
Though there are a lot of different types of graphs in discrete mathematics, there are some that are extremely common. Some of those are as follows:
Null graph.
Connected graph.
Disconnected graph.
Bipartite graph.
Weighted graph.
Directed graph.
Simple graph.
Multi-graph.
Answer to the Q. No - 2
Application of Graph -
In Computer science graphs are used to represent the flow of computation.
Google maps uses graphs for building transportation systems, where intersection of two(or more) roads are considered to be a vertex and the road connecting two vertices is considered to be an edge, thus their navigation system is based on the algorithm to calculate the shortest path between two vertices.
In Facebook, users are considered to be the vertices and if they are friends then there is an edge running between them. Facebook’s Friend suggestion algorithm uses graph theory. Facebook is an example of undirected graph.
In World Wide Web, web pages are considered to be the vertices. There is an edge from a page u to other page v if there is a link of page v on page u. This is an example of Directed graph. It was the basic idea behind Google Page Ranking Algorithm.
In Operating System, we come across the Resource Allocation Graph where each process and resources are considered to be vertices. Edges are drawn from resources to the allocated process, or from requesting process to the requested resource. If this leads to any formation of a cycle, then a deadlock will occur.
A graph is a non-linear data structure, which consists of vertices (or nodes) connected by edges where edges may be directed or undirected.
Types of Graphs:
Though there are a lot of different types of graphs in discrete mathematics, there are some that are extremely common. Some of those are as follows:
Null graph.
Connected graph.
Disconnected graph.
Bipartite graph.
Weighted graph.
Directed graph.
Simple graph.
Multi-graph.
Answer to the Q. No - 2
Application of Graph -
In Computer science graphs are used to represent the flow of computation.
Google maps uses graphs for building transportation systems, where intersection of two(or more) roads are considered to be a vertex and the road connecting two vertices is considered to be an edge, thus their navigation system is based on the algorithm to calculate the shortest path between two vertices.
In Facebook, users are considered to be the vertices and if they are friends then there is an edge running between them. Facebook’s Friend suggestion algorithm uses graph theory. Facebook is an example of undirected graph.
In World Wide Web, web pages are considered to be the vertices. There is an edge from a page u to other page v if there is a link of page v on page u. This is an example of Directed graph. It was the basic idea behind Google Page Ranking Algorithm.
In Operating System, we come across the Resource Allocation Graph where each process and resources are considered to be vertices. Edges are drawn from resources to the allocated process, or from requesting process to the requested resource. If this leads to any formation of a cycle, then a deadlock will occur.
1. A graph is a non-linear data structure, which consists of vertices (or nodes) connected by edges (or arcs) where edges may be directed or undirected.
Types of Graphs:
Though there are a lot of different types of graphs in discrete mathematics, there are some that are extremely common. Some of those are as follows:
1. Null graph: Also called an empty graph, a null graph is a graph in which there are no edges between any of its vertices.
2. Connected graph: A graph in which there is a path of edges between every pair of vertices in the graph. Mary's graph is a connected graph, since there is a way to get from every city on the map to every other city.
3.Disconnected graph: A graph in which the path of edges does not always connect every vertex.
4. Bipartite graph: A graph that can be split into two sets of vertices such that edges only go between sets, not within them.
5. Weighted graph: A graph in which weights, or numerical values, are assigned to each of the edges. Mary's graph is a weighted graph, where the distances between the cities are the weights of the edges.
6.Directed graph: A graph in which the edges are directed by arrows, indicating that the relationship, represented by the edge, only applies from one vertex to the other, but not the other way around. In other words, if a directed edge has an arrow from A to B, A is related to B, but B is not related to A.
7.Undirected graph: A graph whose edges are not directed. Mary's graph is an undirected graph, because the routes between cities go both ways.
8. Simple graph: An undirected graph in which there is at most one edge between each pair of vertices, and there are no loops, which is an edge from a vertex to itself.
9. Multi-graph: A graph in which there are multiple edges between any pair of vertices or there are edges from a vertex to itself, also called a loop.
10. Planar graph: A graph that can be drawn so that all of the edges of the graph do not cross each other.
11. Nonplanar graph: A graph that is not a planar graph. In other words, a graph that cannot be drawn without at least one pair of its edges crossing.
2. Application of Graph;
In Computer science graphs are used to represent the flow of computation.
1.Google maps uses graphs for building transportation systems, where intersection of two(or more) roads are considered to be a vertex and the road connecting two vertices is considered to be an edge, thus their navigation system is based on the algorithm to calculate the shortest path between two vertices.
2. In Facebook, users are considered to be the vertices and if they are friends then there is an edge running between them. Facebook’s Friend suggestion algorithm uses graph theory. Facebook is an example of undirected graph.
3. In World Wide Web, web pages are considered to be the vertices. There is an edge from a page u to other page v if there is a link of page v on page u. This is an example of Directed graph. It was the basic idea behind Google Page Ranking Algorithm.
4. In Operating System, we come across the Resource Allocation Graph where each process and resources are considered to be vertices. Edges are drawn from resources to the allocated process, or from requesting process to the requested resource. If this leads to any formation of a cycle, then a deadlock will occur.
Types of Graphs:
Though there are a lot of different types of graphs in discrete mathematics, there are some that are extremely common. Some of those are as follows:
1. Null graph: Also called an empty graph, a null graph is a graph in which there are no edges between any of its vertices.
2. Connected graph: A graph in which there is a path of edges between every pair of vertices in the graph. Mary's graph is a connected graph, since there is a way to get from every city on the map to every other city.
3.Disconnected graph: A graph in which the path of edges does not always connect every vertex.
4. Bipartite graph: A graph that can be split into two sets of vertices such that edges only go between sets, not within them.
5. Weighted graph: A graph in which weights, or numerical values, are assigned to each of the edges. Mary's graph is a weighted graph, where the distances between the cities are the weights of the edges.
6.Directed graph: A graph in which the edges are directed by arrows, indicating that the relationship, represented by the edge, only applies from one vertex to the other, but not the other way around. In other words, if a directed edge has an arrow from A to B, A is related to B, but B is not related to A.
7.Undirected graph: A graph whose edges are not directed. Mary's graph is an undirected graph, because the routes between cities go both ways.
8. Simple graph: An undirected graph in which there is at most one edge between each pair of vertices, and there are no loops, which is an edge from a vertex to itself.
9. Multi-graph: A graph in which there are multiple edges between any pair of vertices or there are edges from a vertex to itself, also called a loop.
10. Planar graph: A graph that can be drawn so that all of the edges of the graph do not cross each other.
11. Nonplanar graph: A graph that is not a planar graph. In other words, a graph that cannot be drawn without at least one pair of its edges crossing.
2. Application of Graph;
In Computer science graphs are used to represent the flow of computation.
1.Google maps uses graphs for building transportation systems, where intersection of two(or more) roads are considered to be a vertex and the road connecting two vertices is considered to be an edge, thus their navigation system is based on the algorithm to calculate the shortest path between two vertices.
2. In Facebook, users are considered to be the vertices and if they are friends then there is an edge running between them. Facebook’s Friend suggestion algorithm uses graph theory. Facebook is an example of undirected graph.
3. In World Wide Web, web pages are considered to be the vertices. There is an edge from a page u to other page v if there is a link of page v on page u. This is an example of Directed graph. It was the basic idea behind Google Page Ranking Algorithm.
4. In Operating System, we come across the Resource Allocation Graph where each process and resources are considered to be vertices. Edges are drawn from resources to the allocated process, or from requesting process to the requested resource. If this leads to any formation of a cycle, then a deadlock will occur.
Answer-1:
In computer science, a graph is an abstract data type that is meant to implement the undirected graph and directed graph concepts from the field of graph theory within mathematics.
Types-
Null graph: Also called an empty graph, a null graph is a graph in which there are no edges between any of its vertices.
Connected graph: A graph in which there is a path of edges between every pair of vertices in the graph. Mary's graph is a connected graph, since there is a way to get from every city on the map to every other city.
Disconnected graph: A graph in which the path of edges does not always connect every vertex.
Bipartite graph: A graph that can be split into two sets of vertices such that edges only go between sets, not within them.
Weighted graph: A graph in which weights, or numerical values, are assigned to each of the edges. Mary's graph is a weighted graph, where the distances between the cities are the weights of the edges.
Directed graph: A graph in which the edges are directed by arrows, indicating that the relationship, represented by the edge, only applies from one vertex to the other, but not the other way around. In other words, if a directed edge has an arrow from A to B, A is related to B, but B is not related to A.
Undirected graph: A graph whose edges are not directed. Mary's graph is an undirected graph, because the routes between cities go both ways.
Simple graph: An undirected graph in which there is at most one edge between each pair of vertices, and there are no loops, which is an edge from a vertex to itself.
Multi-graph: A graph in which there are multiple edges between any pair of vertices or there are edges from a vertex to itself, also called a loop.
Planar graph: A graph that can be drawn so that all of the edges of the graph do not cross each other.
Nonplanar graph: A graph that is not a planar graph. In other words, a graph that cannot be drawn without at least one pair of its edges crossing.
Answer-2:
In Computer science graphs are used to represent the flow of computation.
Google maps uses graphs for building transportation systems, where intersection of two(or more) roads are considered to be a vertex and the road connecting two vertices is considered to be an edge, thus their navigation system is based on the algorithm to calculate the shortest path between two vertices.
In Facebook, users are considered to be the vertices and if they are friends then there is an edge running between them. Facebook’s Friend suggestion algorithm uses graph theory. Facebook is an example of undirected graph.
In World Wide Web, web pages are considered to be the vertices. There is an edge from a page u to other page v if there is a link of page v on page u. This is an example of Directed graph. It was the basic idea behind Google Page Ranking Algorithm.
In Operating System, we come across the Resource Allocation Graph where each process and resources are considered to be vertices. Edges are drawn from resources to the allocated process, or from requesting process to the requested resource. If this leads to any formation of a cycle then a deadlock will occur.
In computer science, a graph is an abstract data type that is meant to implement the undirected graph and directed graph concepts from the field of graph theory within mathematics.
Types-
Null graph: Also called an empty graph, a null graph is a graph in which there are no edges between any of its vertices.
Connected graph: A graph in which there is a path of edges between every pair of vertices in the graph. Mary's graph is a connected graph, since there is a way to get from every city on the map to every other city.
Disconnected graph: A graph in which the path of edges does not always connect every vertex.
Bipartite graph: A graph that can be split into two sets of vertices such that edges only go between sets, not within them.
Weighted graph: A graph in which weights, or numerical values, are assigned to each of the edges. Mary's graph is a weighted graph, where the distances between the cities are the weights of the edges.
Directed graph: A graph in which the edges are directed by arrows, indicating that the relationship, represented by the edge, only applies from one vertex to the other, but not the other way around. In other words, if a directed edge has an arrow from A to B, A is related to B, but B is not related to A.
Undirected graph: A graph whose edges are not directed. Mary's graph is an undirected graph, because the routes between cities go both ways.
Simple graph: An undirected graph in which there is at most one edge between each pair of vertices, and there are no loops, which is an edge from a vertex to itself.
Multi-graph: A graph in which there are multiple edges between any pair of vertices or there are edges from a vertex to itself, also called a loop.
Planar graph: A graph that can be drawn so that all of the edges of the graph do not cross each other.
Nonplanar graph: A graph that is not a planar graph. In other words, a graph that cannot be drawn without at least one pair of its edges crossing.
Answer-2:
In Computer science graphs are used to represent the flow of computation.
Google maps uses graphs for building transportation systems, where intersection of two(or more) roads are considered to be a vertex and the road connecting two vertices is considered to be an edge, thus their navigation system is based on the algorithm to calculate the shortest path between two vertices.
In Facebook, users are considered to be the vertices and if they are friends then there is an edge running between them. Facebook’s Friend suggestion algorithm uses graph theory. Facebook is an example of undirected graph.
In World Wide Web, web pages are considered to be the vertices. There is an edge from a page u to other page v if there is a link of page v on page u. This is an example of Directed graph. It was the basic idea behind Google Page Ranking Algorithm.
In Operating System, we come across the Resource Allocation Graph where each process and resources are considered to be vertices. Edges are drawn from resources to the allocated process, or from requesting process to the requested resource. If this leads to any formation of a cycle then a deadlock will occur.
1. A graph is a non-linear data structure, which consists of vertices (or nodes) connected by edges (or arcs) where edges may be directed or undirected.
Types of Graphs:
Though there are a lot of different types of graphs in discrete mathematics, there are some that are extremely common. Some of those are as follows:
1. Null graph: Also called an empty graph, a null graph is a graph in which there are no edges between any of its vertices.
2. Connected graph: A graph in which there is a path of edges between every pair of vertices in the graph. Mary's graph is a connected graph, since there is a way to get from every city on the map to every other city.
3.Disconnected graph: A graph in which the path of edges does not always connect every vertex.
4. Bipartite graph: A graph that can be split into two sets of vertices such that edges only go between sets, not within them.
5. Weighted graph: A graph in which weights, or numerical values, are assigned to each of the edges. Mary's graph is a weighted graph, where the distances between the cities are the weights of the edges.
6.Directed graph: A graph in which the edges are directed by arrows, indicating that the relationship, represented by the edge, only applies from one vertex to the other, but not the other way around. In other words, if a directed edge has an arrow from A to B, A is related to B, but B is not related to A.
7.Undirected graph: A graph whose edges are not directed. Mary's graph is an undirected graph, because the routes between cities go both ways.
8. Simple graph: An undirected graph in which there is at most one edge between each pair of vertices, and there are no loops, which is an edge from a vertex to itself.
9. Multi-graph: A graph in which there are multiple edges between any pair of vertices or there are edges from a vertex to itself, also called a loop.
10. Planar graph: A graph that can be drawn so that all of the edges of the graph do not cross each other.
11. Nonplanar graph: A graph that is not a planar graph. In other words, a graph that cannot be drawn without at least one pair of its edges crossing.
2. Application of Graph;
In Computer science graphs are used to represent the flow of computation.
1.Google maps uses graphs for building transportation systems, where intersection of two(or more) roads are considered to be a vertex and the road connecting two vertices is considered to be an edge, thus their navigation system is based on the algorithm to calculate the shortest path between two vertices.
2. In Facebook, users are considered to be the vertices and if they are friends then there is an edge running between them. Facebook’s Friend suggestion algorithm uses graph theory. Facebook is an example of undirected graph.
3. In World Wide Web, web pages are considered to be the vertices. There is an edge from a page u to other page v if there is a link of page v on page u. This is an example of Directed graph. It was the basic idea behind Google Page Ranking Algorithm.
4. In Operating System, we come across the Resource Allocation Graph where each process and resources are considered to be vertices. Edges are drawn from resources to the allocated process, or from requesting process to the requested resource. If this leads to any formation of a cycle, then a deadlock will occur.
Types of Graphs:
Though there are a lot of different types of graphs in discrete mathematics, there are some that are extremely common. Some of those are as follows:
1. Null graph: Also called an empty graph, a null graph is a graph in which there are no edges between any of its vertices.
2. Connected graph: A graph in which there is a path of edges between every pair of vertices in the graph. Mary's graph is a connected graph, since there is a way to get from every city on the map to every other city.
3.Disconnected graph: A graph in which the path of edges does not always connect every vertex.
4. Bipartite graph: A graph that can be split into two sets of vertices such that edges only go between sets, not within them.
5. Weighted graph: A graph in which weights, or numerical values, are assigned to each of the edges. Mary's graph is a weighted graph, where the distances between the cities are the weights of the edges.
6.Directed graph: A graph in which the edges are directed by arrows, indicating that the relationship, represented by the edge, only applies from one vertex to the other, but not the other way around. In other words, if a directed edge has an arrow from A to B, A is related to B, but B is not related to A.
7.Undirected graph: A graph whose edges are not directed. Mary's graph is an undirected graph, because the routes between cities go both ways.
8. Simple graph: An undirected graph in which there is at most one edge between each pair of vertices, and there are no loops, which is an edge from a vertex to itself.
9. Multi-graph: A graph in which there are multiple edges between any pair of vertices or there are edges from a vertex to itself, also called a loop.
10. Planar graph: A graph that can be drawn so that all of the edges of the graph do not cross each other.
11. Nonplanar graph: A graph that is not a planar graph. In other words, a graph that cannot be drawn without at least one pair of its edges crossing.
2. Application of Graph;
In Computer science graphs are used to represent the flow of computation.
1.Google maps uses graphs for building transportation systems, where intersection of two(or more) roads are considered to be a vertex and the road connecting two vertices is considered to be an edge, thus their navigation system is based on the algorithm to calculate the shortest path between two vertices.
2. In Facebook, users are considered to be the vertices and if they are friends then there is an edge running between them. Facebook’s Friend suggestion algorithm uses graph theory. Facebook is an example of undirected graph.
3. In World Wide Web, web pages are considered to be the vertices. There is an edge from a page u to other page v if there is a link of page v on page u. This is an example of Directed graph. It was the basic idea behind Google Page Ranking Algorithm.
4. In Operating System, we come across the Resource Allocation Graph where each process and resources are considered to be vertices. Edges are drawn from resources to the allocated process, or from requesting process to the requested resource. If this leads to any formation of a cycle, then a deadlock will occur.
1. Answer:
Graph is a non-linear data structure that is same as the mathematical (discrete mathematics) concept of graphs. It is a collection of nodes (also called as vertices) and edges that connect these vertices. Graphs are used to represent arbitrary relationship among objects. A graph can be directed or undirected.
There are several different types of charts and graphs. The four most common are probably line graphs, bar graphs and histograms, pie charts, and Cartesian graphs.
2. Answer:
The application of graph:
1. In Computer science graphs are used to represent the flow of computation.
2. Google maps uses graphs for building transportation systems, where intersection of two(or more) roads are considered to be a vertex and the road connecting two vertices is considered to be an edge, thus their navigation system is based on the algorithm to calculate the shortest path between two vertices.
3. In Facebook, users are considered to be the vertices and if they are friends then there is an edge running between them. Facebook’s Friend suggestion algorithm uses graph theory. Facebook is an example of undirected graph.
4. In World Wide Web, web pages are considered to be the vertices. There is an edge from a page u to other page v if there is a link of page v on page u. This is an example of Directed graph. It was the basic idea behind Google Page Ranking Algorithm.
5. In Operating System, we come across the Resource Allocation Graph where each process and resources are considered to be vertices. Edges are drawn from resources to the allocated process, or from requesting process to the requested resource. If this leads to any formation of a cycle then a deadlock will occur.
Graph is a non-linear data structure that is same as the mathematical (discrete mathematics) concept of graphs. It is a collection of nodes (also called as vertices) and edges that connect these vertices. Graphs are used to represent arbitrary relationship among objects. A graph can be directed or undirected.
There are several different types of charts and graphs. The four most common are probably line graphs, bar graphs and histograms, pie charts, and Cartesian graphs.
2. Answer:
The application of graph:
1. In Computer science graphs are used to represent the flow of computation.
2. Google maps uses graphs for building transportation systems, where intersection of two(or more) roads are considered to be a vertex and the road connecting two vertices is considered to be an edge, thus their navigation system is based on the algorithm to calculate the shortest path between two vertices.
3. In Facebook, users are considered to be the vertices and if they are friends then there is an edge running between them. Facebook’s Friend suggestion algorithm uses graph theory. Facebook is an example of undirected graph.
4. In World Wide Web, web pages are considered to be the vertices. There is an edge from a page u to other page v if there is a link of page v on page u. This is an example of Directed graph. It was the basic idea behind Google Page Ranking Algorithm.
5. In Operating System, we come across the Resource Allocation Graph where each process and resources are considered to be vertices. Edges are drawn from resources to the allocated process, or from requesting process to the requested resource. If this leads to any formation of a cycle then a deadlock will occur.