Results on monochromatic vertex disconnection of graphs

Abstract

<abstract><p>Let $ G $ be a vertex-colored graph. A vertex cut $ S $ of $ G $ is called a <italic>monochromatic vertex cut</italic> if the vertices of $ S $ are colored with the same color. A graph $ G $ is <italic>monochromatically vertex-disconnected</italic> if any two nonadjacent vertices of $ G $ have a monochromatic vertex cut separating them. The <italic>monochromatic vertex disconnection number</italic> of $ G $, denoted by $ mvd(G) $, is the maximum number of colors that are used to make $ G $ monochromatically vertex-disconnected. In this paper, the connection between the graph parameters are studied: $ mvd(G) $, connectivity and block decomposition. We determine the value of $ mvd(G) $ for some well-known graphs, and then characterize $ G $ when $ n-5\leq mvd(G)\leq n $ and all blocks of $ G $ are minimally 2-connected triangle-free graphs. We obtain the maximum size of a graph $ G $ with $ mvd(G) = k $ for any $ k $. Finally, we study the Erdős-Gallai-type results for $ mvd(G) $, and completely solve them.</p></abstract>