- Tytuł:
- On the Total Graph of Mycielski Graphs, Central Graphs and Their Covering Numbers
- Autorzy:
-
Patil, H.P.
Pandiya Raj, R. - Powiązania:
- https://bibliotekanauki.pl/articles/30146583.pdf
- Data publikacji:
- 2013-05-01
- Wydawca:
- Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
- Tematy:
-
total graph
central graph
middle graph
Mycielski graph
independence number
covering number
edge independence number
edge covering number
chromatic number
achromatic number - Opis:
- 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.
- Źródło:
-
Discussiones Mathematicae Graph Theory; 2013, 33, 2; 361-371
2083-5892 - Pojawia się w:
- Discussiones Mathematicae Graph Theory
- Dostawca treści:
- Biblioteka Nauki
Artykuł