Graphs Without Induced
نویسنده
چکیده
Zverovich [Discuss. Math. Graph Theory 23 (2003), 159–162.] has proved that the domination number and connected domination number are equal on all connected graphs without induced P5 and C5. Here we show (with an independent proof) that the following stronger result is also valid: Every P5-free and C5-free connected graph contains a minimum-size dominating set that induces a complete subgraph.
منابع مشابه
On list vertex 2-arboricity of toroidal graphs without cycles of specific length
The vertex arboricity $rho(G)$ of a graph $G$ is the minimum number of subsets into which the vertex set $V(G)$ can be partitioned so that each subset induces an acyclic graph. A graph $G$ is called list vertex $k$-arborable if for any set $L(v)$ of cardinality at least $k$ at each vertex $v$ of $G$, one can choose a color for each $v$ from its list $L(v)$ so that the subgraph induced by ev...
متن کاملBounding cochordal cover number of graphs via vertex stretching
It is shown that when a special vertex stretching is applied to a graph, the cochordal cover number of the graph increases exactly by one, as it happens to its induced matching number and (Castelnuovo-Mumford) regularity. As a consequence, it is shown that the induced matching number and cochordal cover number of a special vertex stretching of a graph G are equal provided G is well-covered bipa...
متن کاملDistance-regular graphs without 4-claws
We determine the distance-regular graphs with diameter at least 3 and c2 ≥ 2 but without induced K1,4-subgraphs.
متن کاملMaximum Weight Independent Sets in Odd-Hole-Free Graphs Without Dart or Without Bull
The Maximum Weight Independent Set (MWIS) Problem on graphs with vertex weights asks for a set of pairwise nonadjacent vertices of maximum total weight. Being one of the most investigated and most important problems on graphs, it is well known to be NP-complete and hard to approximate. The complexity of MWIS is open for hole-free graphs (i.e., graphs without induced subgraphs isomorphic to a ch...
متن کاملA Generalization of Slightly Triangulated Graphs
Maire introduced the class of those graphs without long holes, for which every induced subgraph possesses a vertex whose neighbourhood has no P4. Those graphs are called slightly triangulated graphs and are proven to be perfect in [14]. In this paper, we introduce a wider class of graphs, obtained by relaxing the neighbourhood condition. We also provide polynomial algorithms to recognize and to...
متن کاملOn mirror nodes in graphs without long induced paths
The notion of mirror nodes, first introduced by Fomin, Grandoni and Kratsch in 2006, turned out to be a useful item for their design of an algorithm for the maximum independent set problem (MIS). Given two nodes u, v of a graph G = (V, E) with distG(u, v) = 2, u is called a mirror of v if N(v) \N(u) induces a (possibly empty) clique. In order to have a well defined term, we add that every compl...
متن کامل