Journal of Mathematics Research
Tulgeity of Line Graphs
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.
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 3.0 License.
Journal of Mathematics Research ISSN 1916-9795 (Print) ISSN 1916-9809 (Online)
Copyright © Canadian Center of Science and Education
To make sure that you can receive messages from us, please add the 'ccsenet.org' domain to your e-mail 'safe list'. If you do not receive e-mail in your 'inbox', check your 'bulk mail' or 'junk mail' folders.