Displaying similar documents to “The irregularity of graphs under graph operations”

Universality in Graph Properties with Degree Restrictions

Izak Broere, Johannes Heidema, Peter Mihók (2013)

Discussiones Mathematicae Graph Theory

Similarity:

Rado constructed a (simple) denumerable graph R with the positive integers as vertex set with the following edges: For given m and n with m < n, m is adjacent to n if n has a 1 in the m’th position of its binary expansion. It is well known that R is a universal graph in the set [...] of all countable graphs (since every graph in [...] is isomorphic to an induced subgraph of R). A brief overview of known universality results for some induced-hereditary subsets of [...] is provided....

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. ...

Extremely Irregular Graphs

M. Tavakoli, F. Rahbarnia, M. Mirzavaziri, A. R. Ashrafi, I. Gutman (2013)

Kragujevac Journal of Mathematics

Similarity: