Show that the maximum number of edges in simple unconnected graph G with n vertices and k component

  Рет қаралды 19,230

4G Silver Academy தமிழ்

4G Silver Academy தமிழ்

Күн бұрын

Пікірлер: 3
@saidivyavlogs1
@saidivyavlogs1 3 ай бұрын
Good explanation sir
@ibbu_17
@ibbu_17 Ай бұрын
3 semester important questions podunga anna
@Pkeditorprasanna
@Pkeditorprasanna 3 ай бұрын
Bro MA3355 video upload bro
Euler Circuit in Tamil | Discrete Maths in Tamil | MA3354 in Tamil | Unit 3 Graphs in Tamil
8:56
Euler Circuit in Tamil | Discrete Maths in Tamil | MA3354 in Tamil | Unit 3 Graphs in Tamil
4G Silver Academy தமிழ்
Рет қаралды 17 М.
Show that the simple graph G with n vertices is connected if it has more than (n-1)(n-2)/2 edges
6:46
Show that the simple graph G with n vertices is connected if it has more than (n-1)(n-2)/2 edges
4G Silver Academy தமிழ்
Рет қаралды 9 М.
How to treat Acne💉
00:31
How to treat Acne💉
ISSEI / いっせい
Рет қаралды 108 МЛН
Beat Ronaldo, Win $1,000,000
22:45
Beat Ronaldo, Win $1,000,000
MrBeast
Рет қаралды 158 МЛН
Quando A Diferença De Altura É Muito Grande 😲😂
00:12
Quando A Diferença De Altura É Muito Grande 😲😂
Mari Maria
Рет қаралды 45 МЛН
Mom Hack for Cooking Solo with a Little One! 🍳👶
00:15
Mom Hack for Cooking Solo with a Little One! 🍳👶
5-Minute Crafts HOUSE
Рет қаралды 23 МЛН
Show that the maximum number of edges in a simple graph with n vertices is n(n-1)/2 in Tamil MA3354
5:14
Show that the maximum number of edges in a simple graph with n vertices is n(n-1)/2 in Tamil MA3354
4G Silver Academy தமிழ்
Рет қаралды 12 М.
2024's Biggest Breakthroughs in Math
15:13
2024's Biggest Breakthroughs in Math
Quanta Magazine
Рет қаралды 519 М.
I made Tetris in C, this is what I learned
15:15
I made Tetris in C, this is what I learned
Austin Larsen
Рет қаралды 5 М.
Large Language Models explained briefly
8:48
Large Language Models explained briefly
3Blue1Brown
Рет қаралды 956 М.
Show that in a complemented Lattice the following are equivalent Discrete Maths MA3354 Tamil Unit 5
10:14
Show that in a complemented Lattice the following are equivalent Discrete Maths MA3354 Tamil Unit 5
4G Silver Academy தமிழ்
Рет қаралды 41 М.
Graph Theory | A simple graph with n vertices and k components can have atmost (n-k)(n-k+1)/2 edges
16:54
Graph Theory | A simple graph with n vertices and k components can have atmost (n-k)(n-k+1)/2 edges
Mathematics Kala
Рет қаралды 21 М.
физтех отжигает на псевдонаучке ФизФака МГУ Full HD
20:12
физтех отжигает на псевдонаучке ФизФака МГУ Full HD
MrBecaro
Рет қаралды 3,9 МЛН
ML Was Hard Until I Learned These 5 Secrets!
13:11
ML Was Hard Until I Learned These 5 Secrets!
Boris Meinardus
Рет қаралды 347 М.
#11 A given connected graph G is Euler graph if and only if all the vertices of G are of even degree
7:40
#11 A given connected graph G is Euler graph if and only if all the vertices of G are of even degree
WELCOME ENGINEERS
Рет қаралды 53 М.
How to treat Acne💉
00:31
How to treat Acne💉
ISSEI / いっせい
Рет қаралды 108 МЛН