On the Existence of Certain Graphs with Diameter Two
Ferdinand Gliviak, Ján Plesník (1969)
Matematický časopis
Similarity:
Displaying similar documents to “On Irreducible Graphs of Diameter Two without Triangles”
On the Existence of Certain Graphs with Diameter Two
On the Extension of Graphs with a Given Diameter without Superfluous Edges
Ferdinand Gliviak, Peter Kyš, Ján Plesník (1969)
Matematický časopis
Similarity:
On Certain Edge-Critical Graphs of a Given Diameter
Ferdinand Gliviak (1975)
Matematický časopis
Similarity:
On the Total Graph of Mycielski Graphs, Central Graphs and Their Covering Numbers
H.P. Patil, R. Pandiya Raj (2013)
Discussiones Mathematicae Graph Theory
Similarity:
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. ...