On the Total Graph of Mycielski Graphs, Central Graphs and Their Covering Numbers
Autor: | R. Pandiya Raj, H.P. Patil |
---|---|
Jazyk: | angličtina |
Rok vydání: | 2013 |
Předmět: |
Symmetric graph
mycielski graph achromatic number central graph law.invention Combinatorics covering number law chromatic number Outerplanar graph Line graph QA1-939 Discrete Mathematics and Combinatorics independence number Graph property Mathematics Discrete mathematics Applied Mathematics Voltage graph total graph edge covering number edge independence number middle graph Triangle-free graph Cubic graph Null graph |
Zdroj: | Discussiones Mathematicae Graph Theory, Vol 33, Iss 2, Pp 361-371 (2013) |
ISSN: | 2083-5892 |
Popis: | 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. |
Databáze: | OpenAIRE |
Externí odkaz: |