Tulgeity of Line Graphs
Akbar Ali, S. Panayappan · Journal of Mathematics Research · 2010
Tulgeity $\tau(G)$ is the maximum number of disjoint, point induced,non acyclic subgraphs contained in $G$. The formula for the tulgeityof the line graph of complete graph and complete bigraph arederived. Also we present an upperbound for the tulgeity of linegraph of any graph and we classify the graph for which theupperbound becomes the formula.