On the total graph of Mycielski graphs, central graphs and their covering numbers
Copyright policy )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 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.
mycielski graph, total graph, edge covering number, achromatic number, central graph, edge independence number, middle graph, covering number, chromatic number, QA1-939, independence number, Mathematics
mycielski graph, total graph, edge covering number, achromatic number, central graph, edge independence number, middle graph, covering number, chromatic number, QA1-939, independence number, Mathematics
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).2 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!