Displaying similar documents to “Equitable coloring on total graph of bigraphs and central graph of cycles and paths.”

Locally C n k graphs.

Buset, Dominique (1995)

Bulletin of the Belgian Mathematical Society - Simon Stevin

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

The Well-Covered Dimension Of Products Of Graphs

Isaac Birnbaum, Megan Kuneli, Robyn McDonald, Katherine Urabe, Oscar Vega (2014)

Discussiones Mathematicae Graph Theory

Similarity:

We discuss how to find the well-covered dimension of a graph that is the Cartesian product of paths, cycles, complete graphs, and other simple graphs. Also, a bound for the well-covered dimension of Kn × G is found, provided that G has a largest greedy independent decomposition of length c < n. Formulae to find the well-covered dimension of graphs obtained by vertex blowups on a known graph, and to the lexicographic product of two known graphs are also given.