90,921 research outputs found
Edge-Stable Equimatchable Graphs
A graph is \emph{equimatchable} if every maximal matching of has the
same cardinality. We are interested in equimatchable graphs such that the
removal of any edge from the graph preserves the equimatchability. We call an
equimatchable graph \emph{edge-stable} if , that is the
graph obtained by the removal of edge from , is also equimatchable for
any . After noticing that edge-stable equimatchable graphs are
either 2-connected factor-critical or bipartite, we characterize edge-stable
equimatchable graphs. This characterization yields an time recognition algorithm. Lastly, we introduce and shortly
discuss the related notions of edge-critical, vertex-stable and vertex-critical
equimatchable graphs. In particular, we emphasize the links between our work
and the well-studied notion of shedding vertices, and point out some open
questions
Linear rank-width of distance-hereditary graphs I. A polynomial-time algorithm
Linear rank-width is a linearized variation of rank-width, and it is deeply
related to matroid path-width. In this paper, we show that the linear
rank-width of every -vertex distance-hereditary graph, equivalently a graph
of rank-width at most , can be computed in time , and a linear layout witnessing the linear rank-width can be computed with
the same time complexity. As a corollary, we show that the path-width of every
-element matroid of branch-width at most can be computed in time
, provided that the matroid is given by an
independent set oracle.
To establish this result, we present a characterization of the linear
rank-width of distance-hereditary graphs in terms of their canonical split
decompositions. This characterization is similar to the known characterization
of the path-width of forests given by Ellis, Sudborough, and Turner [The vertex
separation and search number of a graph. Inf. Comput., 113(1):50--79, 1994].
However, different from forests, it is non-trivial to relate substructures of
the canonical split decomposition of a graph with some substructures of the
given graph. We introduce a notion of `limbs' of canonical split
decompositions, which correspond to certain vertex-minors of the original
graph, for the right characterization.Comment: 28 pages, 3 figures, 2 table. A preliminary version appeared in the
proceedings of WG'1
The Price of Connectivity for Vertex Cover
The vertex cover number of a graph is the minimum number of vertices that are
needed to cover all edges. When those vertices are further required to induce a
connected subgraph, the corresponding number is called the connected vertex
cover number, and is always greater or equal to the vertex cover number.
Connected vertex covers are found in many applications, and the relationship
between those two graph invariants is therefore a natural question to
investigate. For that purpose, we introduce the {\em Price of Connectivity},
defined as the ratio between the two vertex cover numbers. We prove that the
price of connectivity is at most 2 for arbitrary graphs. We further consider
graph classes in which the price of connectivity of every induced subgraph is
bounded by some real number . We obtain forbidden induced subgraph
characterizations for every real value .
We also investigate critical graphs for this property, namely, graphs whose
price of connectivity is strictly greater than that of any proper induced
subgraph. Those are the only graphs that can appear in a forbidden subgraph
characterization for the hereditary property of having a price of connectivity
at most . In particular, we completely characterize the critical graphs that
are also chordal.
Finally, we also consider the question of computing the price of connectivity
of a given graph. Unsurprisingly, the decision version of this question is
NP-hard. In fact, we show that it is even complete for the class , the class of decision problems that can be solved in polynomial
time, provided we can make queries to an NP-oracle. This paves the
way for a thorough investigation of the complexity of problems involving ratios
of graph invariants.Comment: 19 pages, 8 figure
On the Core of a Unicyclic Graph
A set S is independent in a graph G if no two vertices from S are adjacent.
By core(G) we mean the intersection of all maximum independent sets. The
independence number alpha(G) is the cardinality of a maximum independent set,
while mu(G) is the size of a maximum matching in G. A connected graph having
only one cycle, say C, is a unicyclic graph. In this paper we prove that if G
is a unicyclic graph of order n and n-1 = alpha(G) + mu(G), then core(G)
coincides with the union of cores of all trees in G-C.Comment: 8 pages, 5 figure
- …