Akbar Ali, V. Panayappan, Vernold, Vivin
Abstract
Tulgeity r(G) is the maximum number of disjoint, point induced, non acyclic subgraphs contained in G. In this paper one finds the tulgeity of line, middle and total graph of wheel graph, Gear graph and Helm graph.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Tulgeity r(G) is the maximum number of disjoint, point induced, non acyclic subgraphs contained in G. In this paper one finds the tulgeity of line, middle and total graph of wheel graph, Gear graph and Helm graph.
Key concepts: Combinatorics, Line graph, Graph, Voltage graph, Butterfly graph, Mathematics, Disjoint sets, Null graph