TreeGraphQ
TreeGraphQ[g]
Examples
open all close allScope (6)
TreeGraphQ works with undirected graphs:
TreeGraphQ gives False for anything that is not a tree graph:
TreeGraphQ works with large graphs:
Properties & Relations (10)
A tree graph can be a simple graph:
A tree graph can be a weighted graph:
A star is a special tree with as many leaves as possible:
A path graph with no repeated vertices is a tree with two leaves:
A graph with self-loops is not a tree graph:
A graph with cycles is not a tree graph:
A disconnected graph is not a tree graph:
A tree graph with 
vertices has 
edges:
Possible Issues (1)
TreeGraphQ gives False for non-explicit graphs:
Text
Wolfram Research (2010), TreeGraphQ, Wolfram Language function, https://reference.wolfram.com/language/ref/TreeGraphQ.html.
CMS
Wolfram Language. 2010. "TreeGraphQ." Wolfram Language & System Documentation Center. Wolfram Research. https://reference.wolfram.com/language/ref/TreeGraphQ.html.
APA
Wolfram Language. (2010). TreeGraphQ. Wolfram Language & System Documentation Center. Retrieved from https://reference.wolfram.com/language/ref/TreeGraphQ.html