Displaying similar documents to “On the Maximum and Minimum Sizes of a Graph with Givenk-Connectivity”

Effect of edge-subdivision on vertex-domination in a graph

Amitava Bhattacharya, Gurusamy Rengasamy Vijayakumar (2002)

Discussiones Mathematicae Graph Theory

Similarity:

Let G be a graph with Δ(G) > 1. It can be shown that the domination number of the graph obtained from G by subdividing every edge exactly once is more than that of G. So, let ξ(G) be the least number of edges such that subdividing each of these edges exactly once results in a graph whose domination number is more than that of G. The parameter ξ(G) is called the subdivision number of G. This notion has been introduced by S. Arumugam and S. Velammal. They have conjectured that for any...