Clique and Community

[@xiaokangzhang9456]

Sorry, but I don't see any k=4 clique for the graph at 6:18. For example, 1-2-3-8 are not fully connected, therefore it's not a clique.

[@santiagollanojimenez2408]

yes, am i right saying that every node has to be directly connected?

[@renegade5946]

@@santiagollanojimenez2408 Yes.

[@pranab134]

Yes you are correct.

[@ladiharish7843]

clique (1 2 8 ) and clique(2 4 5) can not form community since they don't have k-1 or (3-1=2) vertices in common.
Also cliques for k=4 is mentioned incorrect in example since it must be fully-connected graph

[@siddheshrane6934]

You said clique is a complete graph but then at 6:20 you made 1-8-2-3 a clique which is not a complete graph(all pairs of nodes should be directly connected so basically n*(n-1)/2 edges where n is number of nodes) bcuz 3 and 8 is not connected.
I think problem is solved incorrectly from exam point of view or kindly correct me if i am wrong.

[@renegade5946]

The lecturer has assumed the edges connecting 4-6 and 3-8.

[@ojasrahate6959]

Ma'am at 7:34 there are 2 4-cliques but 4, 6 and 3,8 don't have a link. (clique is a complete graph)

[@AnuradhaBhatia]

Its for a complete graph, if we assume a link then its is.

[@akshayaap315]

mam in the second example they've also asked to find the betweenness factor. would you mind telling what actually betweenness factor is ? thank you!

[@terigopula]

A community is defined as the maximal union of k-cliques that can be reached from each other through a series of adjacent k-cliques.

[@AnuradhaBhatia]

Swapnil Borse yes sir, but that goes for the basics for community

[@Sofia-ty5yj]

In the 2nd example, can B-C-G-H-F-D-B form a clique for k=6?

[@theapoorvbhatia]

In the second example when we take k = 4. we can only find 2 cliques the third one ie 7 , 3 ,6,2 are not all connected to each other therfore cant form a clique. This is to my best knowledge , please change the video if you find this to be true.

[@PratikPradhan10596]

Apoorv Bhatia Exactly..

[@chinmaykhobre6034]

for example start from 8:56..

[@sanjogpatil2909]

Ma'am if community are not getting form .. so we should assume the edge between C and H and solved in exam , or we should write " no k-1 connectivity in clique so no community will formed " in exam..?
And if k is not given the what we should do..??

[@AnuradhaBhatia]

If k is not given then you can choose as 2and solve for clique and community .

[@sanjogpatil2909]

@@AnuradhaBhatia Thank you ma'am .
But in second example if there no connectivity between clique to form community, then we should have to stop or assume path like between in C and H and continue ...
In exam .

[@deveshrawool6035]

Question for forming a community between cliques the number of k must be same ? For instance can a clique be formed between clique with k=3 and clique with k=4 or should the value be same ?

[@mansingraomore4385]

How can we write the steps for finding the cliques?

[@AnuradhaBhatia]

Mansingrao More will send u

[@mansingraomore4385]

Anuradha Bhatia
Yes mam plzz send it

[@monateja9999]

Mam how do 2 3 7 and 6 form an clique of 4 can you please explain?

[@hitesh2975]

5:51
For 2 k-clinques to be adjacent they must have k-1 nodes in common
Therefor with only node 2 being common it is not a clinque community.

[@alirezavarazgany101]

Hi, it was a good informative article, thank you

[@mathandnatureman]

Thanks for helping...

[@all-day-games6465]

show me with proper step by step... procedure

[@AnuradhaBhatia]

ALL-DAY-GAMES
With respect to???

[@all-day-games6465]

but in paper how can i write steps... shoew me d steps plz

[@AnuradhaBhatia]

ALL-DAY-GAMES
1. Define clique and community.
2. As shown in video, how the clique and community are formed for various values of K.
3. Using a graph show with example.
BEST OF LUCK.

[@all-day-games6465]

Anuradha Bhatia ok ty

[@jayeshjadhav2215]

Thank you

[@naveenojha5603]

thanx mam

[@fatmamahmoud842]

great

[@dikaixue3050]

Sorry but you are doing wrong.