Abstract

Tulgeity $\tau(G)$ is the maximum number of disjoint, point induced,
non acyclic subgraphs contained in $G$. The formula for the tulgeity
of the line graph of complete graph and complete bigraph are
derived. Also we present an upperbound for the tulgeity of line
graph of any graph and we classify the graph for which the
upperbound becomes the formula.

This work is licensed under a Creative Commons Attribution 4.0 License.