What is the Strong Product Of Graphs? [Discrete Mathematics] +3 examples!

[@kvenu88]

Great work! Thank you .. One small suggestion, please normalize the audio, so that the loudness level of speech matches with the level of music that plays at the end. We will have increased the volume all the way up to hear you, and suddenly the music explodes at the end!

[@VitalSine]

Thank you for the suggestion, I will work to fix that issue 🙂

[@AlexAsh25]

great tutorial

[@VitalSine]

Thanks, glad you liked it!

[@rembautimes8808]

Subscribed to this great channel

[@VitalSine]

Thank you so much! Welcome aboard 👍

[@samiyaramzan6303]

What is difference between strong product , lexicographic product and cartesian product in graph??

[@VitalSine]

Great question. The difference is in the adjacency rules. All three products take two graphs, G and H, as input, and all three products output a graph whose vertex set is the set cartesian product of the vertex sets of G and H. In the graph cartesian product, the vertices (u, v) and (u', v') are adjacent if either u = u' and v is adjacent to v', OR u is adjacent to u' and v = v'. That is the adjacency rule for cartesian products. In the strong product, the vertices (u, v) and (u', v') are adjacent if either u = u' and v is adjacent to v', OR u is adjacent to u' and v = v', OR u is adjacent to u' and v is adjacent to v'. It is the same as cartesian product but with one extra condition (the last one). In the lexicographic product, the vertices (u, v) and (u', v') are adjacent if either u = u' and v is adjacent to v', OR if u is adjacent to u' (regardless of the relationship between v and v'). The lexicographic product will generally be the most dense of the three. Hope this helps!

[@Alirazakb]

NEPS of graph

[@bhi-learning1807]

Great, Does tensor product is also known as direct product

[@VitalSine]

Thank you! Yes, the tensor product is also known as the direct product.

[@Alirazakb]

Plz discuss NEPS of graph

[@VitalSine]

Sure thing, I will work on a video covering the NEPS of graphs.

[@Alirazakb]

@@VitalSine thank you so much Sir m w8ing.... ❤️

[@Alirazakb]

@@VitalSine still waiting

[@VitalSine]

@Ali raza Hello, I am almost done with the NEPS video. I'll have it out tomorrow at 16:00 UTC👍

[@Alirazakb]

@@VitalSine Sir don't know how I can thank you

[@Alirazakb]

Plzzzz NEPS