Yes of course, thanks for the question! A star graph has one inner vertex, which is adjacent to all the outer vertices. None of the outer vertices are adjacent to each other. So each star graph is a bipartite graph, where the inner vertex is in one partite set, and all the outer vertices are in the other partite set. But not only is it a bipartite graph, it is a complete bipartite graph! This is because every edge that could exist between the partite sets does exist, because the inner vertex is adjacent to all outer vertices. Does that help?
Thanks for watching and I'm not sure what you mean. Do you mean a particular type of spanning subgraph? A spanning subgraph just contains all vertices of the original graph, so if we want a spanning subgraph then just take all the vertices, and then choose whatever edges you please. And if you're looking for more graph theory, check out my playlist! th-cam.com/play/PLztBpqftvzxXBhbYxoaZJmnZF6AUQr1mH.html
Thanks for watching and for the question! A bistar graph is a graph that consists of two star graphs with their center vertices joined by an edge. So if you take two star graphs, then add an edge joining their center vertices, that whole graph is a bistar graph! Does that help?
can you explain the relation of bipartite graphs and star graphs, I didn't catch the meaning
Thanks.
Yes of course, thanks for the question! A star graph has one inner vertex, which is adjacent to all the outer vertices. None of the outer vertices are adjacent to each other. So each star graph is a bipartite graph, where the inner vertex is in one partite set, and all the outer vertices are in the other partite set. But not only is it a bipartite graph, it is a complete bipartite graph! This is because every edge that could exist between the partite sets does exist, because the inner vertex is adjacent to all outer vertices. Does that help?
@@WrathofMath yeah, I got it. Thanks!!
can you explain the star convex graph
Thank you !!
You're very welcome! Thanks for watching!
How can we find spanning subgraph of star graph ?
Thanks for watching and I'm not sure what you mean. Do you mean a particular type of spanning subgraph? A spanning subgraph just contains all vertices of the original graph, so if we want a spanning subgraph then just take all the vertices, and then choose whatever edges you please.
And if you're looking for more graph theory, check out my playlist! th-cam.com/play/PLztBpqftvzxXBhbYxoaZJmnZF6AUQr1mH.html
Like A Star Paths in games?
Nice, can you please do a video on
Decomposition of graph sir
I'm on it! Thanks for watching!
Here is the lesson! th-cam.com/video/BiLjdZYj_RI/w-d-xo.html
Thanks again for watching and for the request!
Can you please suggest a name of book and author which this concept( star tree)
Anyone ever hear about StarLAN?
Do anyone know about bistar graphs
Thanks for watching and for the question! A bistar graph is a graph that consists of two star graphs with their center vertices joined by an edge. So if you take two star graphs, then add an edge joining their center vertices, that whole graph is a bistar graph! Does that help?
@@WrathofMath That was a star-tlingly good description 👍