doubt about my last question
I have a very basic doubt. If we talk about rooted graph, can we consider
any graph whose one vertex is labeled in a special way to distinguished it
from other vertices or only rooted tree. this doubt is about my last
question to clear doubt about basic definition in graph theory.
Here in the definiton can we take any graph like cycles, or complete
graphs or only rooted tress. Thanks a lot for help.
No comments:
Post a Comment