Geodesic
On the Total Graph of Mycielski Graphs, Central Graphs and Their Covering Numbers
Discussiones Mathematicae. Graph Theory, Tome 33 (2013) no. 2, pp. 361-371.

Voir la notice de l'article provenant de la source Library of Science

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 triangles in the Mycielski and other well known transformations of graphs. Finally, it is shown that the achromatic number and edge-covering number of the transformations mentioned above are equated.
Keywords: total graph, central graph, middle graph, Mycielski graph, independence number, covering number, edge independence number, edge covering number, chromatic number, achromatic number 
@article{DMGT_2013_33_2_a9,
     author = {Patil, H.P. and Pandiya Raj, R.},
     title = {On the {Total} {Graph} of {Mycielski} {Graphs,} {Central} {Graphs} and {Their} {Covering} {Numbers}},
     journal = {Discussiones Mathematicae. Graph Theory},
     pages = {361--371},
     publisher = {mathdoc},
     volume = {33},
     number = {2},
     year = {2013},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/DMGT_2013_33_2_a9/}
}
TY  - JOUR
AU  - Patil, H.P.
AU  - Pandiya Raj, R.
TI  - On the Total Graph of Mycielski Graphs, Central Graphs and Their Covering Numbers
JO  - Discussiones Mathematicae. Graph Theory
PY  - 2013
SP  - 361
EP  - 371
VL  - 33
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DMGT_2013_33_2_a9/
LA  - en
ID  - DMGT_2013_33_2_a9
ER  - 
%0 Journal Article
%A Patil, H.P.
%A Pandiya Raj, R.
%T On the Total Graph of Mycielski Graphs, Central Graphs and Their Covering Numbers
%J Discussiones Mathematicae. Graph Theory
%D 2013
%P 361-371
%V 33
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DMGT_2013_33_2_a9/
%G en
%F DMGT_2013_33_2_a9
Patil, H.P.; Pandiya Raj, R. On the Total Graph of Mycielski Graphs, Central Graphs and Their Covering Numbers. Discussiones Mathematicae. Graph Theory, Tome 33 (2013) no. 2, pp. 361-371. http://geodesic.mathdoc.fr/item/DMGT_2013_33_2_a9/

[1] F. Harary, Graph Theory (Narosa Publishing Home, 1969).

[2] G.J. Chang, L. Huang and X. Zhu, Circular chromatic numbers of Mycielski’s graphs, Discrete Math. 205 (1999) 23-37. doi:10.1016/S0012-365X(99)00033-3

[3] G. Kortsarz and S. Shende, Approximating the Achromatic Number Problem on Bipartite Graphs, (Springer Berlin / Heidelberg, 2003) LNCS Vol. 2832 385-396.

[4] J.A. Bondy and U.S.R. Murty, Graph Theory with Applications (London, MacMillan, 1976).

[5] M.M. Ali Akbar, K. Kaliraj and Vernold J. Vivin, On equitable coloring of central graphs and total graphs, Electron. Notes Discrete Math. 33 (2009) 1-6. doi:10.1016/j.endm.2009.03.001

[6] Ramakrishnan, MPhil-Thesis, (Pondicherry University, Puducherry, India, 1988).

[7] Vernold J. Vivin, M. Venkatachalam and M.M. Ali Akbar, A note on achromatic coloring of star graph families, Filomat 23(3) (2009) 251-255. doi:10.2298/FIL0903251V