Tulgeity of Line Graphs
- Akbar Ali
- S. Panayappan
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.
- Full Text:
PDF
- DOI:10.5539/jmr.v2n2p146
Journal Metrics
- h-index (December 2021): 22
- i10-index (December 2021): 78
- h5-index (December 2021): N/A
- h5-median (December 2021): N/A
( The data was calculated based on Google Scholar Citations. Click Here to Learn More. )
Index
- Academic Journals Database
- ACNP
- Aerospace Database
- BASE (Bielefeld Academic Search Engine)
- Civil Engineering Abstracts
- CNKI Scholar
- COPAC
- DTU Library
- EconPapers
- Elektronische Zeitschriftenbibliothek (EZB)
- EuroPub Database
- Google Scholar
- Harvard Library
- IDEAS
- Infotrieve
- JournalTOCs
- LOCKSS
- MathGuide
- MathSciNet
- MIAR
- PKP Open Archives Harvester
- Publons
- RePEc
- ResearchGate
- Scilit
- SHERPA/RoMEO
- SocioRePEc
- Standard Periodical Directory
- Technische Informationsbibliothek (TIB)
- The Keepers Registry
- UCR Library
- Universe Digital Library
- WorldCat
Contact
- Sophia WangEditorial Assistant
- jmr@ccsenet.org