![Trending Articles on Technical and Non Technical topics](/images/trending_categories.jpeg)
Data Structure
Networking
RDBMS
Operating System
Java
MS Excel
iOS
HTML
CSS
Android
Python
C Programming
C++
C#
MongoDB
MySQL
Javascript
PHP
Physics
Chemistry
Biology
Mathematics
English
Economics
Psychology
Social Studies
Fashion Studies
Legal Studies
- Selected Reading
- UPSC IAS Exams Notes
- Developer's Best Practices
- Questions and Answers
- Effective Resume Writing
- HR Interview Questions
- Computer Glossary
- Who is Who
Found 466 Articles for Mathematics
![Mahesh Parahar](https://www.tutorialspoint.com/assets/profiles/127878/profile/60_2277600-1655382864.jpg)
32K+ Views
It is the number of vertices adjacent to a vertex V. Notation − deg(V). In a simple graph with n number of vertices, the degree of any vertices is − deg(v) = n – 1 ∀ v ∈ G A vertex can form an edge with all other vertices except by itself. So the degree of a vertex will be up to the number of vertices in the graph minus 1. This 1 is for the self-vertex as it cannot form a loop by itself. If there is a loop at any of the vertices, then it is not a ... Read More
![Mahesh Parahar](https://www.tutorialspoint.com/assets/profiles/127878/profile/60_2277600-1655382864.jpg)
31K+ Views
Whether it is possible to traverse a graph from one vertex to another is determined by how a graph is connected. Connectivity is a basic concept in Graph Theory. Connectivity defines whether a graph is connected or disconnected.ConnectivityA graph is said to be connected if there is a path between every pair of vertex. From every vertex to any other vertex, there should be some path to traverse. That is called the connectivity of a graph. A graph with multiple disconnected vertices and edges is said to be disconnected.Cut VertexLet 'G' be a connected graph. A vertex V ∈ G ... Read More
![Mahesh Parahar](https://www.tutorialspoint.com/assets/profiles/127878/profile/60_2277600-1655382864.jpg)
354 Views
Whether it is possible to traverse a graph from one vertex to another is determined by how a graph is connected. Connectivity is a basic concept in Graph Theory. Connectivity defines whether a graph is connected or disconnected. It has subtopics based on edge and vertex, known as edge connectivity and vertex connectivity. Let us discuss them in detail.ConnectivityA graph is said to be connected if there is a path between every pair of vertex. From every vertex to any other vertex, there should be some path to traverse. That is called the connectivity of a graph. A graph with ... Read More
![Mahesh Parahar](https://www.tutorialspoint.com/assets/profiles/127878/profile/60_2277600-1655382864.jpg)
17K+ Views
Connected GraphA graph is connected if any two vertices of the graph are connected by a path.Vertex 1Vertex 2PATHaba baca b c, a cada b c d, a c dbcb a c , b ccdc dDisconnected GraphA graph is disconnected if at least two vertices of the graph are not connected by a path. If a graph G is disconnected, then every maximal connected subgraph of G is called a connected component of the graph G.Vertex 1Vertex 2PATHaba bacNot AvailableadNot AvailablebcNot Availablecdc d
![Mahesh Parahar](https://www.tutorialspoint.com/assets/profiles/127878/profile/60_2277600-1655382864.jpg)
2K+ Views
Trees are graphs that do not contain even a single cycle. They represent hierarchical structure in a graphical form. Trees belong to the simplest class of graphs. Despite their simplicity, they have a rich structure.Trees provide a range of useful applications as simple as a family tree to as complex as trees in data structures of computer science.TreeA connected acyclic graph is called a tree. In other words, a connected graph with no cycles is called a tree.The edges of a tree are known as branches. Elements of trees are called their nodes. The nodes without child nodes are called ... Read More
![Mahesh Parahar](https://www.tutorialspoint.com/assets/profiles/127878/profile/60_2277600-1655382864.jpg)
501 Views
Two functions f: A → B and g: B → C can be composed to give a composition g o f. This is a function from A to C defined by (g o f)(x) = g(f(x))ExampleLet f(x) = x + 2 and g(x) = 2x + 1, find (f o g)(x) and (g o f)(x).Solution(f o g)(x) = f(g(x)) = f(2x + 1) = 2x + 1 + 2 = 2x + 3(g o f)(x) = g (f(x)) = g(x + 2) = 2 (x+2) + 1 = 2x + 5Hence, (f o g)(x) ≠ (g o f)(x)Some Facts about ... Read More
![Mahesh Parahar](https://www.tutorialspoint.com/assets/profiles/127878/profile/60_2277600-1655382864.jpg)
425 Views
The inverse of a one-to-one corresponding function f: A → B, is the function g: B → A, holding the following property −f(x) = y ⇔ g(y) = xThe function f is called invertible if its inverse function g exists.ExampleA Function f : Z → Z, f(x)=x+5, is invertible since it has the inverse function g : Z → Z, g(x)= x-5.A Function f : Z → Z, f(x)=x2 is not invertiable since this is not one-to-one as (-x)2=x2.
![Mahesh Parahar](https://www.tutorialspoint.com/assets/profiles/127878/profile/60_2277600-1655382864.jpg)
3K+ Views
Let 'G−' be a simple graph with some vertices as that of 'G' and an edge {U, V} is present in 'G−', if the edge is not present in G. It means, two vertices are adjacent in 'G−' if the two vertices are not adjacent in G.If the edges that exist in graph I are absent in another graph II, and if both graph I and graph II are combined together to form a complete graph, then graph I and graph II are called complements of each other.ExampleIn the following example, graph-I has two edges 'cd' and 'bd'. Its complement ... Read More
![Mahesh Parahar](https://www.tutorialspoint.com/assets/profiles/127878/profile/60_2277600-1655382864.jpg)
596 Views
Graph coloring is nothing but a simple way of labelling graph components such as vertices, edges, and regions under some constraints. In a graph, no two adjacent vertices, adjacent edges, or adjacent regions are colored with minimum number of colors. This number is called the chromatic number and the graph is called a properly colored graph.While graph coloring, the constraints that are set on the graph are colors, order of coloring, the way of assigning color, etc. A coloring is given to a vertex or a particular region. Thus, the vertices or regions having same colors form independent sets.Vertex ColoringVertex ... Read More
![Mahesh Parahar](https://www.tutorialspoint.com/assets/profiles/127878/profile/60_2277600-1655382864.jpg)
4K+ Views
The rules of mathematical logic specify methods of reasoning mathematical statements. Greek philosopher, Aristotle, was the pioneer of logical reasoning. Logical reasoning provides the theoretical base for many areas of mathematics and consequently computer science. It has many practical applications in computer science like design of computing machines, artificial intelligence, definition of data structures for programming languages etc.Major CategoriesMathematical logics can be broadly categorized into three categories.Propositional Logic − Propositional Logic is concerned with statements to which the truth values, "true" and "false", can be assigned. The purpose is to analyse these statements either individually or in a composite manner.Predicate ... Read More