On the Total Graph of Mycielski Graphs, Central Graphs and Their Covering Numbers

The technique of counting cliques in networks is a natural problem. In this paper, we develop certain results on counting of triangles for the total graph of the Mycielski graph or central graph of star as well as completegraph families. Moreover, we discuss the upper bounds for the number of triang...

Full description

Bibliographic Details

Main Authors:	Patil H.P., Pandiya Raj R.
Format:	Artigo
Language:	Inglês
Published:	University of Zielona Góra 2013-05-01
Series:	Discussiones Mathematicae Graph Theory
Subjects:	total graph central graph middle graph mycielski graph independence number covering number edge independence number edge covering number chromatic number achromatic number
Online Access:	https://doi.org/10.7151/dmgt.1670
Tags:	Add Tag No Tags, Be the first to tag this record!