Hello Readers
Hope you are doing well.
Today i am writing a short note on Pseudo-graph. Generally people get confused about the definition of pseudo-graph.
Pseudo word refers to spurious i.e. `mithya’.
Some authors say that a graph without multiple edges and self-loops is called pseudo-graph while others produce the examples of pseudo-graph as a graph with selfloops only or multiple edges only and sometimes both.
I researched a lot on this topic and what i understood that
Pseudo graph is a graph that is not simple graph.
Simple Graph: A graph that does not have self-loops as well as multiple edges is called simple graph.
So if G has self-loops, implies G is not simple, implies pseudo graph.
If G has multiple edges, implies G is not simple, implies pseudo graph.
If G has multiple edges and self-loops both, implies G is not simple, implies pseudo graph.
So don’t get confused, follow the following definition:
A graph that has either self-loops or multiple edges or both, is called pseudo graph.
If this post is satisfactory then like and comment.
Stay learn, Stay happy
Thank You
Dr. Namita Tiwari
Very informative post mam. Thanks for sharing.
LikeLiked by 1 person
Thanks mam đŸ™‚
LikeLiked by 1 person
thanku very much mam for sharing it.
LikeLiked by 1 person