Neha Bisht

Spanning subgraph in graph theory

Neha Bisht

What is Asymptotic notations ( best case, worst case and average case)

Neha Bisht

What is subgraph with its properties

Neha Bisht

What is time complexity

Neha Bisht

What is Trail and Circuit

Neha Bisht

What is space complexity & Algorithm complexity in Data structure

Neha Bisht

Walk and Path (for undirected graph)

Neha Bisht

Isomorphic graph

Neha Bisht

Associative property under addition

Neha Bisht

Data structure and it's type

Neha Bisht

What is commutative property

Neha Bisht

Operations of graph ( Part 3) FusionMerge

Neha Bisht

Operations of graph (Part 2) Ringsum & Deletion

Neha Bisht

Closure property under addition and subtraction, Additive identity

Neha Bisht

operations of graph (part 1) union and intersection

Neha Bisht

Math excercise 1.1 (last part) in hindi

Neha Bisht

Bipartite, Complete Bipartite graph, multi, pseudo, finite and infinite graph

Neha Bisht

7th standard Math ncert excercise 1.1 question 7 to questions 9 with solutions.

Neha Bisht

7th standard Math ncert excercise 1.1 question 3 to questions 6 with solutions.

Neha Bisht

theorem- the number of vertices with odd degree in a graph 'G' is always even.

Neha Bisht

Theorem- Sum of degree of all vertices is twice the number of edge, handshaking lemma

Neha Bisht

Null, Trivial, complete and regular graph

Neha Bisht

Number line representation of integer, Excercise on Integers, 7th standard math, excercise 1.1

Neha Bisht

Connected and Disconnected graph

Neha Bisht

What are Integers and Additive Inverse

Neha Bisht

Directed graph, finding degree of its vertex.

Neha Bisht

Numerical of Simple Graph, Undirected graph and degree of vertex in Undirected graph

Neha Bisht

Simple Graph, parallel edge, Self loop & Dipole Graph

Neha Bisht

What is Graph

Neha Bisht